Theoretical analysis of fitness-proportional selection: landscapes and efficiency
暂无分享,去创建一个
[1] Carsten Witt,et al. Runtime Analysis of the ( μ +1) EA on Simple Pseudo-Boolean Functions , 2006 .
[2] Frank Neumann,et al. Rigorous analyses of fitness-proportional selection for optimizing linear functions , 2008, GECCO '08.
[3] Ingo Wegener,et al. Evolutionary Algorithms and the Maximum Matching Problem , 2003, STACS.
[4] Xin Yao,et al. Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results , 2007, Int. J. Autom. Comput..
[5] Kenneth A. De Jong,et al. Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods on the Choice of the Offspring Population Size in Evolutionary Algorithms on the Choice of the Offspring Population Size in Evolutionary Algorithms , 2004 .
[6] Jens Jägersküpper,et al. When the Plus Strategy Outperforms the Comma Strategyand When Not , 2007, 2007 IEEE Symposium on Foundations of Computational Intelligence.
[7] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[8] Pietro Simone Oliveto,et al. Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation , 2008, Algorithmica.
[9] Ingo Wegener,et al. On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics , 2005, Combinatorics, Probability and Computing.
[10] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[11] Carsten Witt,et al. Runtime Analysis of the ( + 1) EA on Simple Pseudo-Boolean Functions , 2006, Evolutionary Computation.