Do additional target points speed up evolutionary algorithms?

[1]  Benjamin Doerr,et al.  Fixed-Target Runtime Analysis , 2021, Algorithmica.

[2]  Dirk Sudholt,et al.  Do additional optima speed up evolutionary algorithms? , 2021, FOGA.

[3]  Benjamin Doerr,et al.  Generalized jump functions , 2021, GECCO.

[4]  Benjamin Doerr,et al.  Lower bounds from fitness levels made easy , 2021, GECCO.

[5]  Timo Kötzing,et al.  Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints , 2020, Theor. Comput. Sci..

[6]  Benjamin Doerr,et al.  Fixed-Target Runtime Analysis , 2020, GECCO.

[7]  Mojgan Pourhassan,et al.  Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint , 2019, Algorithmica.

[8]  Thomas Bäck,et al.  Theory of Evolutionary Computation: Recent Developments in Discrete Optimization , 2020, Theory of Evolutionary Computation.

[9]  Dirk Sudholt,et al.  Time complexity analysis of RLS and (1 + 1) EA for the edge coloring problem , 2019, FOGA '19.

[10]  Johannes Lengler,et al.  Exponential slowdown for larger populations: the (µ + 1)-EA on monotone functions , 2019, FOGA '19.

[11]  Hsien-Kuei Hwang,et al.  Probabilistic Analysis of the (1+1)-Evolutionary Algorithm , 2014, Evolutionary Computation.

[12]  Benjamin Doerr,et al.  Fast genetic algorithms , 2017, GECCO.

[13]  Wanru Gao,et al.  Runtime Analysis of Evolutionary Diversity Maximization for OneMinMax , 2016, GECCO.

[14]  Dirk Sudholt,et al.  Towards a Runtime Comparison of Natural and Artificial Evolution , 2015, Algorithmica.

[15]  Dirk Sudholt,et al.  The choice of the offspring population size in the (1, λ) evolutionary algorithm , 2014, Theor. Comput. Sci..

[16]  Wanru Gao,et al.  Runtime analysis for maximizing population diversity in single-objective optimization , 2014, GECCO.

[17]  Thomas Jansen,et al.  Analyzing Evolutionary Algorithms , 2015, Natural Computing Series.

[18]  Thomas Jansen,et al.  A method to derive fixed budget results from expected optimisation times , 2013, GECCO '13.

[19]  Dirk Sudholt,et al.  Design and analysis of migration in parallel evolutionary algorithms , 2013, Soft Comput..

[20]  Anne Auger,et al.  Theory of Randomized Search Heuristics: Foundations and Recent Developments , 2011, Theory of Randomized Search Heuristics.

[21]  Per Kristian Lehre,et al.  Black-Box Search by Unbiased Variation , 2010, GECCO '10.

[22]  Dirk Sudholt,et al.  Runtime analysis of a binary particle swarm optimizer , 2010, Theor. Comput. Sci..

[23]  Carsten Witt,et al.  Bioinspired Computation in Combinatorial Optimization , 2010, Bioinspired Computation in Combinatorial Optimization.

[24]  Dirk Sudholt,et al.  The impact of parametrization in memetic evolutionary algorithms , 2009, Theor. Comput. Sci..

[25]  Dirk Sudholt,et al.  Analysis of different MMAS ACO algorithms on unimodal functions and plateaus , 2009, Swarm Intelligence.

[26]  Carsten Witt,et al.  Population size versus runtime of a simple evolutionary algorithm , 2008, Theor. Comput. Sci..

[27]  Frank Neumann,et al.  Do additional objectives make a problem harder? , 2007, GECCO '07.

[28]  Kenneth A. De Jong,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods on the Choice of the Offspring Population Size in Evolutionary Algorithms on the Choice of the Offspring Population Size in Evolutionary Algorithms , 2004 .

[29]  Ingo Wegener,et al.  The one-dimensional Ising model: Mutation versus recombination , 2005, Theor. Comput. Sci..

[30]  Dirk Sudholt,et al.  Crossover is provably essential for the Ising model on trees , 2005, GECCO '05.

[31]  Ingo Wegener,et al.  Real royal road functions--where crossover provably is essential , 2001, Discret. Appl. Math..

[32]  Thomas Jansen,et al.  UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization , 2004 .

[33]  Thomas Jansen,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Evolutionary Algorithms-How to Cope With Plateaus of Constant Fitness and When to Reject Strings of the Same Fitness , 2001 .

[34]  Günter Rudolph,et al.  How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time , 1996, Evolutionary Computation.