Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs
暂无分享,去创建一个
[1] Avi Wigderson,et al. Quadratic Dynamical Systems (Preliminary Version) , 1992, FOCS 1992.
[2] Benjamin Doerr,et al. Crossover can provably be useful in evolutionary computation , 2008, GECCO '08.
[3] Thomas Jansen,et al. On benefits and drawbacks of aging strategies for randomized search heuristics , 2011, Theor. Comput. Sci..
[4] Dirk Sudholt,et al. Update Strength in EDAs and ACO: How to Avoid Genetic Drift , 2016, GECCO.
[5] Yuval Rabani,et al. A computational view of population genetics , 1995, STOC '95.
[6] Pietro Simone Oliveto,et al. Improved time complexity analysis of the Simple Genetic Algorithm , 2015, Theor. Comput. Sci..
[7] Patrick J. Fitzsimmons,et al. Converse Jensen Inequality , 2009 .
[8] Pietro Simone Oliveto,et al. On the effectiveness of crossover for migration in parallel evolutionary algorithms , 2011, GECCO '11.
[9] Carsten Witt,et al. Domino convergence: why one should hill-climb on linear functions , 2018, GECCO.
[10] H. Geiringer. On the Probability Theory of Linkage in Mendelian Heredity , 1944 .
[11] Yang Yu,et al. An analysis on recombination in multi-objective evolutionary optimization , 2011, GECCO '11.
[12] Benjamin Doerr,et al. Improved analysis methods for crossover-based algorithms , 2009, GECCO.
[13] Frank Neumann,et al. More Effective Crossover Operators for the All-Pairs Shortest Path Problem , 2010, PPSN.
[14] Benjamin Doerr,et al. A tight runtime analysis for the (μ + λ) EA , 2018, GECCO.
[15] Per Kristian Lehre,et al. Escaping Local Optima Using Crossover With Emergent Diversity , 2018, IEEE Transactions on Evolutionary Computation.
[16] Yann Ollivier,et al. Rate of convergence of crossover operators , 2003, Random Struct. Algorithms.
[17] Dirk Sudholt,et al. How crossover helps in pseudo-boolean optimization , 2011, GECCO '11.
[18] Carsten Witt,et al. Runtime Analysis of the ( + 1) EA on Simple Pseudo-Boolean Functions , 2006, Evolutionary Computation.
[19] Thomas Jansen,et al. A building-block royal road where crossover is provably essential , 2007, GECCO '07.
[20] Benjamin Doerr,et al. Multiplicative Drift Analysis , 2010, GECCO '10.
[21] Per Kristian Lehre,et al. Negative Drift in Populations , 2010, PPSN.
[22] Ingo Wegener,et al. Real royal road functions--where crossover provably is essential , 2001, Discret. Appl. Math..
[23] Jens Jägersküpper,et al. Rigorous runtime analysis of a (μ+1)ES for the sphere function , 2005, GECCO '05.
[24] Carsten Witt,et al. Runtime Analysis of the ( μ +1) EA on Simple Pseudo-Boolean Functions , 2006 .
[25] Johannes Lengler,et al. A General Dichotomy of Evolutionary Algorithms on Monotone Functions , 2018, IEEE Transactions on Evolutionary Computation.
[26] Dirk Sudholt,et al. Crossover is provably essential for the Ising model on trees , 2005, GECCO '05.
[27] Leslie Ann Goldberg,et al. Adaptive Drift Analysis , 2011, Algorithmica.
[28] Avi Wigderson,et al. Quadratic dynamical systems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[29] Pietro Simone Oliveto,et al. Analysis of population-based evolutionary algorithms for the vertex cover problem , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).
[30] C. Witt. Population size vs. runtime of a simple EA , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..
[31] Dirk Sudholt,et al. The impact of parametrization in memetic evolutionary algorithms , 2009, Theor. Comput. Sci..
[32] Dirk Sudholt,et al. How Crossover Speeds up Building Block Assembly in Genetic Algorithms , 2014, Evolutionary Computation.
[33] Per Kristian Lehre,et al. On the Impact of Mutation-Selection Balance on the Runtime of Evolutionary Algorithms , 2012, IEEE Trans. Evol. Comput..
[34] Per Kristian Lehre,et al. Crossover can be constructive when computing unique input–output sequences , 2011, Soft Comput..