Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
1. H.-G. Beyer, Towards a theory of evolution strategies: progress rates and quality gain for (1,+λ)-strategies on (nearly) arbitrary fitness functions, in: Proceedings of Parallel Problem Solving from Nature 3 (PPSN), Lecture Notes in Computer Science, Vol. 866, Springer, Berlin, 1994, pp. 58–67.
2. The Theory of Evolution Strategies;Beyer,2001
3. Global convergence for evolution strategies in spherical problems: some simple proofs and difficulties;Bienvenue;Theoretical Computer Science,2001
4. On the analysis of the (1+1) evolutionary algorithm;Droste;Theoretical Computer Science,2002
5. O. Giel, I. Wegener, Evolutionary algorithms and the maximum matching problem, in: Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science, Vol. 2607, Springer, Berlin, 2003, pp. 415–426.
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献