Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
暂无分享,去创建一个
[1] Ingo Wegener,et al. Theoretical Aspects of Evolutionary Algorithms , 2001, ICALP.
[2] Ingo Wegener,et al. Real royal road functions--where crossover provably is essential , 2001, Discret. Appl. Math..
[3] Thomas Jansen,et al. On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..
[4] J. Jägersküpper. UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Analysis of a Simple Evolutionary Algorithm for the Minimization in Euclidian Spaces , 2003 .
[5] Günter Rudolph,et al. Self-adaptive mutations may lead to premature convergence , 2001, IEEE Trans. Evol. Comput..
[6] Hans-Georg Beyer,et al. The Theory of Evolution Strategies , 2001, Natural Computing Series.
[7] Ingo Wegener,et al. On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions , 2005, J. Discrete Algorithms.
[8] Heinz Mühlenbein,et al. How Genetic Algorithms Really Work: Mutation and Hillclimbing , 1992, PPSN.
[9] Thomas Jansen,et al. The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can Help , 2002, Algorithmica.
[10] Garrison W. Greenwood,et al. Convergence in Evolutionary Programs with Self-Adaptation , 2001, Evolutionary Computation.
[11] Ingo Wegener,et al. Evolutionary Algorithms and the Maximum Matching Problem , 2003, STACS.