Author:
Michalewicz Zbigniew,Schoenauer Marc
Reference59 articles.
1. Antonisse, J. (1989). A new interpretation of schema notation that overturns the binary encoding constraint. In J. D. Schaffer (Ed.), Proceedings of the 3rd international conference on genetic algorithms (pp. 86–91). Morgan Kaufmann.
2. Auger, A. (2005). Convergence results for (1, λ)-SA-ES using the theory of φ-irreducible Markov chains. Theoretical Computer Science, 334(1–3), 35–69.
3. Auger, A., & Hansen, N. (2005). A restart CMA evolution strategy with increasing population size. In Proceedings of the CEC’05 (pp. 1769–1776). IEEE Press.
4. Auger, A., & Hansen, N. (2006). Reconsidering the progress rate theory for evolution strategies in finite dimensions. In M. Cattolico (Ed.), Proceedings of the ACM GECCO’06 (pp. 445–452). ACM Press.
5. Bäck, T. (1995). Evolutionary algorithms in theory and practice. New-York: Oxford University Press.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献