Runtime analysis of the (1 + (λ, λ)) genetic algorithm on random satisfiable 3-CNF formulas
暂无分享,去创建一个
[1] Per Kristian Lehre,et al. Black-Box Search by Unbiased Variation , 2010, GECCO '10.
[2] Benjamin Doerr,et al. Optimal Parameter Settings for the (1 + λ, λ) Genetic Algorithm , 2016, GECCO.
[3] William F. Punch,et al. Parameter-less population pyramid , 2014, GECCO.
[4] Benjamin Doerr,et al. From black-box complexity to designing new genetic algorithms , 2015, Theor. Comput. Sci..
[5] Colin McDiarmid,et al. Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .
[6] Dirk Sudholt,et al. Crossover speeds up building-block assembly , 2012, GECCO '12.
[7] Benjamin Doerr,et al. Lessons from the black-box: fast crossover-based genetic algorithms , 2013, GECCO '13.
[8] Benjamin Doerr,et al. A Tight Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on OneMax , 2015, GECCO.
[9] Frank Neumann,et al. Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation , 2015, GECCO.
[10] Anne Auger,et al. Theory of Randomized Search Heuristics: Foundations and Recent Developments , 2011, Theory of Randomized Search Heuristics.
[11] Benjamin Doerr,et al. Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings , 2015, GECCO.
[12] Per Kristian Lehre,et al. Black-box Complexity of Parallel Search with Distributed Populations , 2015, FOGA.
[13] Ingo Wegener,et al. Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions , 2003 .
[14] Frank Neumann,et al. Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas , 2014, PPSN.