Runtime analysis via symmetry arguments: (hot-off-the-press track at GECCO 2021)
暂无分享,去创建一个
[1] Frank Neumann,et al. Bioinspired computation in combinatorial optimization: algorithms and their computational complexity , 2010, GECCO '12.
[2] Benjamin Doerr,et al. Probabilistic Tools for the Analysis of Randomized Optimization Heuristics , 2018, Theory of Evolutionary Computation.
[3] Thomas Bäck,et al. Theory of Evolutionary Computation: Recent Developments in Discrete Optimization , 2020, Theory of Evolutionary Computation.
[4] Benjamin Doerr,et al. Runtime Analysis of Evolutionary Algorithms via Symmetry Arguments , 2020, Inf. Process. Lett..
[5] Dirk Sudholt,et al. A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms , 2011, IEEE Transactions on Evolutionary Computation.
[6] Pietro Simone Oliveto,et al. Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation , 2008, Algorithmica.
[7] Benjamin Doerr,et al. Money for Nothing: Speeding Up Evolutionary Algorithms Through Better Initialization , 2015, GECCO.
[8] Exponential Upper Bounds for the Runtime of Randomized Search Heuristics , 2020, PPSN.
[9] Anne Auger,et al. Theory of Randomized Search Heuristics: Foundations and Recent Developments , 2011, Theory of Randomized Search Heuristics.
[10] Pietro Simone Oliveto,et al. Improved time complexity analysis of the Simple Genetic Algorithm , 2015, Theor. Comput. Sci..
[11] Andrew M. Sutton,et al. Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs , 2019, Algorithmica.
[12] Thomas Jansen,et al. Analyzing Evolutionary Algorithms: The Computer Science Perspective , 2012 .
[13] Benjamin Doerr,et al. The Impact of Random Initialization on the Runtime of Randomized Search Heuristics , 2015, Algorithmica.
[14] Benjamin Doerr,et al. Improved analysis methods for crossover-based algorithms , 2009, GECCO.
[15] Dirk Sudholt,et al. A tight lower bound on the expected runtime of standard steady state genetic algorithms , 2020, GECCO.
[16] Carsten Witt,et al. Domino convergence: why one should hill-climb on linear functions , 2018, GECCO.