Runtime Analysis of Evolutionary Algorithms via Symmetry Arguments
暂无分享,去创建一个
[1] Benjamin Doerr,et al. The Impact of Random Initialization on the Runtime of Randomized Search Heuristics , 2015, Algorithmica.
[2] Pietro Simone Oliveto,et al. Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation , 2008, Algorithmica.
[3] Benjamin Doerr,et al. Improved analysis methods for crossover-based algorithms , 2009, GECCO.
[4] Cristian S. Calude,et al. Journal of Universal Computer Science , 1994, J. Univers. Comput. Sci..
[5] Pietro Simone Oliveto,et al. Improved time complexity analysis of the Simple Genetic Algorithm , 2015, Theor. Comput. Sci..
[6] Frank Neumann,et al. Bioinspired computation in combinatorial optimization: algorithms and their computational complexity , 2010, GECCO '12.
[7] Benjamin Doerr,et al. Money for Nothing: Speeding Up Evolutionary Algorithms Through Better Initialization , 2015, GECCO.
[8] Thomas Bäck,et al. Theory of Evolutionary Computation: Recent Developments in Discrete Optimization , 2020, Theory of Evolutionary Computation.
[9] Andrew M. Sutton,et al. Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs , 2019, Algorithmica.
[10] J. van Leeuwen,et al. Theoretical Computer Science , 2003, Lecture Notes in Computer Science.
[11] Frank Harary. The Automorphism Group of a Hypercube , 2000, J. Univers. Comput. Sci..
[12] Benjamin Doerr. Exponential Upper Bounds for the Runtime of Randomized Search Heuristics , 2020, PPSN.
[13] Carsten Witt,et al. Domino convergence: why one should hill-climb on linear functions , 2018, GECCO.
[14] Benjamin Doerr,et al. Probabilistic Tools for the Analysis of Randomized Optimization Heuristics , 2018, Theory of Evolutionary Computation.
[15] Dirk Sudholt,et al. A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms , 2011, IEEE Transactions on Evolutionary Computation.
[16] Thomas Jansen,et al. Analyzing Evolutionary Algorithms: The Computer Science Perspective , 2012 .