Optimal Mutation Rates for the (1+$$\lambda $$λ) EA on OneMax Through Asymptotically Tight Drift Analysis
暂无分享,去创建一个
[1] Anne Auger,et al. Theory of Randomized Search Heuristics: Foundations and Recent Developments , 2011, Theory of Randomized Search Heuristics.
[2] Marvin Künnemann,et al. Royal road functions and the (1 + λ) evolutionary algorithm: Almost no speed-up from larger offspring populations , 2013, 2013 IEEE Congress on Evolutionary Computation.
[3] Frank Neumann,et al. Bioinspired computation in combinatorial optimization: algorithms and their computational complexity , 2012, GECCO '12.
[4] Per Kristian Lehre,et al. Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift , 2014, ISAAC.
[5] M. Abramowitz,et al. Handbook of Mathematical Functions with Formulas, Graphs and Mathematical Tables. U.S. Department of Commerce, National Bureau of Standards , 1965 .
[6] Hsien-Kuei Hwang,et al. Probabilistic Analysis of the (1+1)-Evolutionary Algorithm , 2014, Evolutionary Computation.
[7] Carsten Witt,et al. Bioinspired Computation in Combinatorial Optimization , 2010, Bioinspired Computation in Combinatorial Optimization.
[8] Enrique Alba,et al. Fitness Probability Distribution of Bit-Flip Mutation , 2013, Evolutionary Computation.
[9] Thomas Jansen,et al. Analyzing Evolutionary Algorithms: The Computer Science Perspective , 2012 .
[10] Thomas Jansen,et al. Analyzing Evolutionary Algorithms , 2015, Natural Computing Series.
[11] M. Abramowitz,et al. Handbook of Mathematical Functions With Formulas, Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55) , 1965 .
[12] J. G. Skellam. The frequency distribution of the difference between two Poisson variates belonging to different populations. , 1946, Journal of the Royal Statistical Society. Series A.
[13] Jonathan E. Rowe,et al. Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links , 2009, Int. J. Intell. Comput. Cybern..
[14] Benjamin Doerr,et al. Optimal Parameter Choices via Precise Black-Box Analysis , 2016, GECCO.
[15] Daniel Johannsen,et al. Random combinatorial structures and randomized search heuristics , 2010 .
[16] Dirk Sudholt,et al. The choice of the offspring population size in the (1, λ) evolutionary algorithm , 2014, Theor. Comput. Sci..
[17] Kenneth A. De Jong,et al. Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods on the Choice of the Offspring Population Size in Evolutionary Algorithms on the Choice of the Offspring Population Size in Evolutionary Algorithms , 2004 .
[18] K. Teerapabolarn,et al. A bound on the Poisson-binomial relative error , 2007 .
[19] Carsten Witt,et al. Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions† , 2013, Combinatorics, Probability and Computing.
[20] Marvin Künnemann,et al. Optimizing linear functions with the (1+λ) evolutionary algorithm - Different asymptotic runtimes for different instances , 2015, Theor. Comput. Sci..
[21] Frank Neumann,et al. Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem , 2010, PPSN.
[22] Carsten Witt,et al. Population Size vs. Mutation Strength for the (1+λ) EA on OneMax , 2015, GECCO.
[23] Carsten Witt,et al. Optimal Mutation Rates for the (1+λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}) EA on One , 2017, Algorithmica.
[24] Mahmoud Fouz,et al. Sharp bounds by probability-generating functions and variable drift , 2011, GECCO '11.
[25] Thomas Jansen,et al. On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..
[26] Leslie Ann Goldberg,et al. Adaptive Drift Analysis , 2010, PPSN.
[27] Per Kristian Lehre,et al. Unbiased Black-Box Complexity of Parallel Search , 2014, PPSN.