Theoretical and empirical study of the (1 + (λ, λ)) EA on the leadingones problem
暂无分享,去创建一个
[1] Dogan Corus,et al. Standard Steady State Genetic Algorithms Can Hillclimb Faster Than Mutation-Only Evolutionary Algorithms , 2017, IEEE Transactions on Evolutionary Computation.
[2] Ingo Wegener,et al. Real royal road functions for constant population size , 2003, Theor. Comput. Sci..
[3] Ingo Wegener,et al. Real royal road functions--where crossover provably is essential , 2001, Discret. Appl. Math..
[4] Benjamin Doerr,et al. Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings , 2015, GECCO.
[5] Benjamin Doerr,et al. Reducing the arity in unbiased black-box complexity , 2014, Theor. Comput. Sci..
[6] Thomas Jansen,et al. The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can Help , 2002, Algorithmica.
[7] Ingo Wegener,et al. On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions , 2005, J. Discrete Algorithms.
[8] William F. Punch,et al. Parameter-less population pyramid , 2014, GECCO.
[9] Ingo Wegener,et al. The Ising Model on the Ring: Mutation Versus Recombination , 2004, GECCO.
[10] Benjamin Doerr,et al. From black-box complexity to designing new genetic algorithms , 2015, Theor. Comput. Sci..
[11] Benjamin Doerr,et al. Reducing the arity in unbiased black-box complexity , 2012, GECCO '12.
[12] Frank Neumann,et al. Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem , 2010, PPSN.
[13] Maxim Buzdalov,et al. Hard Test Generation for Maximum Flow Algorithms with the Fast Crossover-Based Evolutionary Algorithm , 2015, GECCO.
[14] Dirk Sudholt,et al. Crossover is provably essential for the Ising model on trees , 2005, GECCO '05.