On the Choice of the Mutation Probability for the (1+1) EA
- 1 January 2000
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Rigorous Hitting Times for Binary MutationsEvolutionary Computation, 1999
- On the Analysis of Evolutionary Algorithms — A Proof That Crossover Really Can HelpPublished by Springer Nature ,1999
- A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean InputsEvolutionary Computation, 1998
- Fitness distance correlation and Ridge functionsPublished by Springer Nature ,1998
- Parameterized Structured Operational SemanticsFundamenta Informaticae, 1998
- A guided tour of chernoff boundsInformation Processing Letters, 1990