Theoretical Aspects of Evolutionary Algorithms

This publication has 10 references indexed in Scilit:

• Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness
  IEEE Transactions on Evolutionary Computation, 2001
• On the Expected Runtime and the Success Probability of Evolutionary Algorithms (Invited Presentation)
  Published by Springer Nature ,2000
• On the Choice of the Mutation Probability for the (1+1) EA
  Published by Springer Nature ,2000
• Rigorous Hitting Times for Binary Mutations
  Evolutionary Computation, 1999
• 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
• On the optimization of unimodal functions with the (1+1) evolutionary algorithm
  Published by Springer Nature ,1998
• An Overview of Parameter Control Methods by Self-Adaptation in Evolutionary Algorithms
  Fundamenta Informaticae, 1998
• Randomized Algorithms
  Published by Cambridge University Press (CUP) ,1995
• Relative Building-Block Fitness and the Building-Block Hypothesis
  Published by Elsevier ,1993