117 search results - page 4 / 24 » Optimal Mutation Rates and Selection Pressure in Genetic Alg... |
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Traditionally, the mutation rates of genetic algorithms are fixed or decrease over the generations. Although it seems to be reasonable for classical genetic algorithms, it may not...
CEC
2009
IEEE
13 years 5 months ago
2009
IEEE
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we examine the effects of single node mutations on trees evolved via genetic programming. The results show that neutral mutations are less likely for nodes nearer th...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, a genetic algorithm is introduced to generate variants of a choreographic sequence, which are then selected using different criteria. The mutation phase of the algo...