203 search results - page 9 / 41 » Fitness landscapes and problem hardness in evolutionary comp... |
TEC
2002
14 years 9 months ago
2002
It is not unusual that an approximate model is needed for fitness evaluation in evolutionary computation. In this case, the convergence properties of the evolutionary algorithm are...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Previous research has shown that evolutionary systems not only try to develop solutions that satisfy a fitness requirement, but indirectly attempt to develop genetically robust so...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
This paper compares the performance of anti-noise methods, particularly probabilistic and re-sampling methods, using NSGA2. It then proposes a computationally less expensive appro...
CEC
2005
IEEE
15 years 3 months ago
2005
IEEE
Kondrashov and Kondrashov (2001) point out that, although common in population genetic models, epistatic systems where the fitness of a genotype is a non-linear function of the num...
81
Voted
AUSAI
1999
Springer
15 years 1 months ago
1999
Springer
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA),...