|
The 6th International Conference on Software Engineering & Computer Systems (ICSECS) is organized by Faculty of Computer Systems & Software Engineering, Universiti Malaysia Pahang. This conference series serves as a forum for an international community of researchers, practitioners and vendors on all aspects of Software Engineering and Computer Systems. The aim is to bring together researchers and practitioners from all the disciplines that engage with Software Engineering and Computer Systems research. Theme : Industrial Revolution 4.0 : Eyeing The Future
The 6th International Conference on Software Engineering and Computer Systems (ICSECS'19) serves as a platform to address the challenges in the areas of Software Engineering and Computer Systems particularly on the specific issues of Industrial Revolution 4.0 (IR 4.0). With the theme “IR 4.0 : Eyeing the Future”, thereby presenting a consolidated view to the interested researchers in the aforementioned fields. The conference looks for significant contributions towards theoretical and practical aspects on the future applications.
The tracks of this conference emphasise on the NINE (9) pillars of Industrial Revolution 4.0 which are but not limited to :
Track 1: Internet of Things, Big Data and Autonomous Robots
Track 2: Simulation and Virtual/Augmented Reality
Track 3: Additive Manufacturing and System Integration
Track 4: Cyber-Security and Cloud Computing
All accepted papers will be published in:
IOP Conference Series: Materials Science and Engineering; which submitted for Scopus, Thomson Reuters (WoS).
Selected Papers will be published in other journals.
Furthermore, a Conference Workshop on will be held with
Title : Constructing hybrid-meta-heuristics and hyper-heuristics for a general optimization problem
Optimization problems relates to the process of finding the most maximum or the most minimum solution from a set of feasible solutions. In many cases, optimization problems can involve large search spaces, thus, hindering the use of exact and/or exhaustive search algorithms. As such, a compromise good enough solution offered by meta-heuristic algorithms is often sought after owing to timing and computational resource constraints. Despite being useful, typical meta-heuristic algorithms often lack generality and require problem specific modification before competitive solution can be obtained.
For details, please visit our website: https://icsecs.ump.edu.my/index.php/en/
|
