Level-based Analysis of Genetic Algorithms and other Search Processes

29 July 2014

Papers citing "Level-based Analysis of Genetic Algorithms and other Search Processes"

11 / 11 papers shown

Title
Improved Runtime Bounds for the Univariate Marginal Distribution Algorithm via Anti-Concentration Per Kristian Lehre P. Nguyen 38 34 0 02 Feb 2018
Upper Bounds on the Runtime of the Univariate Marginal Distribution Algorithm on OneMax Carsten Witt 22 34 0 31 Mar 2017
Update Strength in EDAs and ACO: How to Avoid Genetic Drift Dirk Sudholt Carsten Witt 27 38 0 14 Jul 2016
Populations can be essential in tracking dynamic optima D. Dang T. Jansen Per Kristian Lehre 23 35 0 12 Jul 2016
Hitting times of local and global optima in genetic algorithms with very high selection pressure A. Eremeev 37 7 0 18 Jun 2016
Self-adaptation of Mutation Rates in Non-elitist Populations D. Dang Per Kristian Lehre 48 84 0 17 Jun 2016
A Tight Runtime Analysis of the $(1+(λ, λ))$ Genetic Algorithm on OneMax Benjamin Doerr Carola Doerr ELM 60 37 0 19 Jun 2015
Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings Benjamin Doerr Carola Doerr 36 76 0 13 Apr 2015
How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms Dirk Sudholt 57 61 0 26 Mar 2014
A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms Dirk Sudholt 53 154 0 07 Sep 2011
On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms Per Kristian Lehre Xin Yao 66 44 0 14 Dec 2010