Author:
Corus Dogan,Dang Duc-Cuong,Eremeev Anton V.,Lehre Per Kristian
Publisher
Springer International Publishing
Reference19 articles.
1. Chen, T., Lehre, P., Tang, K., Yao, X.: When is an estimation of distribution algorithm better than an evolutionary algorithm? In: Proceedings of IEEE Congress on Evolutionary Computation (CEC 2009), pp. 1470–1477 (2009)
2. Dang, D.C., Lehre, P.K.: Refined upper bounds on the expected runtime of non-elitist populations from fitness levels. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2014) (to appear, 2014)
3. Doerr, B., Doerr, C., Ebel, F.: Lessons from the black-box: Fast crossover-based genetic algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2013), pp. 781–788 (2013)
4. Dubhashi, D., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, NY (2009)
5. Lecture Notes in Computer Science;A.V. Eremeev,2000
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献