暂无分享,去创建一个
[1] Heinz Mühlenbein,et al. FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions , 1999, Evolutionary Computation.
[2] Benjamin Doerr,et al. Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem , 2011, Evolutionary Computation.
[3] Rich Caruana,et al. Removing the Genetics from the Standard Genetic Algorithm , 1995, ICML.
[4] Y. Svirezhev,et al. Diffusion Models of Population Genetics , 1990 .
[5] Xin Yao,et al. Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..
[6] Dirk Sudholt,et al. A few ants are enough: ACO with iteration-best update , 2010, GECCO '10.
[7] Heinz Mühlenbein,et al. On the Mean Convergence Time of Evolutionary Algorithms without Selection and Mutation , 1994, PPSN.
[8] Carsten Witt,et al. Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax , 2017, FOGA '17.
[9] Dirk P. Kroese,et al. Convergence properties of the cross-entropy method for discrete optimization , 2007, Oper. Res. Lett..
[10] Shumeet Baluja,et al. A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .
[11] Dirk Sudholt,et al. Medium step sizes are harmful for the compact genetic algorithm , 2018, GECCO.
[12] David E. Goldberg,et al. The compact genetic algorithm , 1999, IEEE Trans. Evol. Comput..
[13] Benjamin Doerr,et al. A tight runtime analysis for the cGA on jump functions: EDAs can cross fitness valleys at no extra cost , 2019, GECCO.
[14] M. Pelikán,et al. The Bivariate Marginal Distribution Algorithm , 1999 .
[15] Per Kristian Lehre,et al. On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help , 2019, FOGA '19.
[16] Paul A. Viola,et al. MIMIC: Finding Optima by Estimating Probability Densities , 1996, NIPS.
[17] Tobias Friedrich,et al. EDAs cannot be Balanced and Stable , 2016, GECCO.
[18] Carsten Witt,et al. Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax , 2018, Algorithmica.
[19] H. Mühlenbein,et al. From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.
[20] Pedro Larrañaga,et al. The Convergence Behavior of the PBIL Algorithm: A Preliminary Approach , 2001 .
[21] Kumara Sastry,et al. Linkage Learning via Probabilistic Modeling in the Extended Compact Genetic Algorithm (ECGA) , 2006, Scalable Optimization via Probabilistic Modeling.
[22] Stefan Droste,et al. A rigorous analysis of the compact genetic algorithm for linear functions , 2006, Natural Computing.
[23] C. McDiarmid. Concentration , 1862, The Dental register.
[24] Laura Kubatko,et al. Diusion Models in Population Genetics , 2015 .
[25] Dirk Sudholt,et al. Update Strength in EDAs and ACO: How to Avoid Genetic Drift , 2016, GECCO.
[26] M. Kimura. Difiusion models in population genetics , 1964 .
[27] Benjamin Doerr,et al. Analyzing randomized search heuristics via stochastic domination , 2019, Theor. Comput. Sci..