Domino convergence, drift, and the temporal-salience structure of problems
暂无分享,去创建一个
[1] M. Kimura,et al. An introduction to population genetics theory , 1971 .
[2] David E. Goldberg,et al. Finite Markov Chain Analysis of Genetic Algorithms , 1987, ICGA.
[3] W. Michael Rudnick. Genetic algorithms and fitness variance with an application to the automated design of neural netoworks , 1992 .
[4] Heinz Mühlenbein,et al. Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization , 1993, Evolutionary Computation.
[5] Dirk Thierens,et al. Toward a Better Understanding of Mixing in Genetic Algorithms , 1993 .
[6] Dirk Thierens,et al. Convergence Models of Genetic Algorithm Selection Schemes , 1994, PPSN.
[7] Heinz Mühlenbein,et al. On the Mean Convergence Time of Evolutionary Algorithms without Selection and Mutation , 1994, PPSN.
[8] Lothar Thiele,et al. A Comparison of Selection Schemes used in Genetic Algorithms , 1995 .
[9] Thomas Bäck,et al. Generalized Convergence Models for Tournament- and (mu, lambda)-Selection , 1995, ICGA.
[10] David E. Goldberg,et al. Genetic Algorithms, Selection Schemes, and the Varying Effects of Noise , 1996, Evolutionary Computation.
[11] G. Harik. Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms , 1997 .