Medium step sizes are harmful for the compact genetic algorithm
暂无分享,去创建一个
[1] Timo Kötzing. Concentration of First Hitting Times Under Additive Drift , 2015, Algorithmica.
[2] David E. Goldberg,et al. The compact genetic algorithm , 1999, IEEE Trans. Evol. Comput..
[3] Roberto Cominetti,et al. A Sharp Uniform Bound for the Distribution of Sums of Bernoulli Trials , 2008, Combinatorics, probability & computing.
[4] Dirk Sudholt,et al. Update Strength in EDAs and ACO: How to Avoid Genetic Drift , 2016, GECCO.
[5] Andrew M. Sutton,et al. The Benefit of Recombination in Noisy Evolutionary Search , 2015, GECCO.
[6] Per Kristian Lehre,et al. Improved runtime bounds for the univariate marginal distribution algorithm via anti-concentration , 2017, GECCO.
[7] Carsten Witt,et al. Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax , 2017, FOGA '17.
[8] Alessandro Panconesi,et al. Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .
[9] Aravind Srinivasan,et al. Probability and Computing , 2018, SIGA.
[10] Stefan Droste,et al. A rigorous analysis of the compact genetic algorithm for linear functions , 2006, Natural Computing.
[11] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[12] Dirk Sudholt,et al. A few ants are enough: ACO with iteration-best update , 2010, GECCO '10.
[13] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .