89 search results - page 11 / 18 » An Analysis of Multi-Point Crossover |
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
This paper analyzes the behavior of a selectorecombinative genetic algorithm (GA) with an ideal crossover on a class of random additively decomposable problems (rADPs). Specifical...
GECCO
2003
Springer
14 years 25 days ago
2003
Springer
This paper analyzes the performance of a genetic algorithm that utilizes tournament selection, one-point crossover, and a reordering operator. A model is proposed to describe the c...
FLAIRS
2006
13 years 9 months ago
2006
In this paper we test whether a correlation exists between the optimal mutation rate and problem difficulty. We find that the range of optimal mutation rates is inversely proporti...
GPEM
2002
13 years 7 months ago
2002
Abstract. This research examines the cause of code growth (bloat) in genetic programming (GP). Currently there are three hypothesized causes of code growth in GP: protection, drift...