On the Analysis of Evolutionary Algorithms — A Proof That Crossover Really Can Help
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 184-193
- https://doi.org/10.1007/3-540-48481-7_17
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A computational view of population geneticsRandom Structures & Algorithms, 1998
- A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean InputsEvolutionary Computation, 1998
- The Metropolis algorithm for graph bisectionDiscrete Applied Mathematics, 1998
- How Mutation and Selection Solve Long-Path Problems in Polynomial Expected TimeEvolutionary Computation, 1996
- Randomized AlgorithmsPublished by Cambridge University Press (CUP) ,1995
- On genetic algorithmsPublished by Association for Computing Machinery (ACM) ,1995
- Long path problemsPublished by Springer Nature ,1994
- Quadratic dynamical systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Simulated Annealing: Theory and ApplicationsPublished by Springer Nature ,1987