Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...
Mario Hilgemeier, Nicole Drechsler, Rolf Drechsler
Genetic Algorithms have widely been used for solving optimization problems in stationary environments. In recent years, there has been a growing interest for investigating and imp...
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution...
In this work MagnetoEncephaloGram (MEG) recordings of epileptic patients were analyzed using a hybrid neural networks training algorithm. This algorithm combines genetic algorithm...
Adam V. Adamopoulos, Efstratios F. Georgopoulos, S...
This paper examines a simulation of the Beer Distribution Game and a number of optimisation approaches to this game. This well known game was developed at MIT in the 1960s and has ...