EC
2006
13 years 5 months ago
2006
The compact Genetic Algorithm (cGA) is an Estimation of Distribution Algorithm that generates offspring population according to the estimated probabilistic model of the parent pop...
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
This paper extends an adaptive discretization method, Spliton-Demand (SoD), to be capable of handling multidimensional continuous search spaces. The proposed extension is called m...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
This paper proposes an adaptive discretization method, called Split-on-Demand (SoD), to enable the probabilistic model building genetic algorithm (PMBGA) to solve optimization pro...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
This paper presents an architecture which is suitable for a massive parallelization of the compact genetic algorithm. The approach is scalable, has low synchronization costs, and i...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents an approach to combine competent crossover and mutation operators via probabilistic model building. Both operators are based on the probabilistic model buildin...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
This paper presents a highly efficient, fully parallelized implementation of the compact genetic algorithm (cGA) to solve very large scale problems with millions to billions of va...