On the Expected Runtime and the Success Probability of Evolutionary Algorithms (Invited Presentation)

This publication has 9 references indexed in Scilit:

• On the Choice of the Mutation Probability for the (1+1) EA
  Published by Springer Nature ,2000
• On the Analysis of Evolutionary Algorithms — A Proof That Crossover Really Can Help
  Published by Springer Nature ,1999
• A computational view of population genetics
  Random Structures & Algorithms, 1998
• The Metropolis algorithm for graph bisection
  Discrete Applied Mathematics, 1998
• Parameterized Structured Operational Semantics
  Fundamenta Informaticae, 1998
• How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time
  Evolutionary Computation, 1996
• Randomized Algorithms
  Published by Cambridge University Press (CUP) ,1995
• Long path problems
  Published by Springer Nature ,1994
• A guided tour of chernoff bounds
  Information Processing Letters, 1990