Coarse-Graining in Genetic Algorithms: Some Issues and Examples
暂无分享,去创建一个
Christopher R. Stephens | Jonathan E. Rowe | Andrés Aguilar Contreras | J. Rowe | C. Stephens | Andres A Contreras Marcillo
[1] Christopher R. Stephens,et al. Effective Degrees of Freedom in Genetic Algorithms and the Block Hypothesis , 1997, ICGA.
[2] C. Stephens. The Renormalization Group and the Dynamics of Genetic Systems , 2002, cond-mat/0210271.
[3] Jonathan E. Rowe,et al. Population Fixed-Points for Functions of Unitation , 1998, FOGA.
[4] Michael D. Vose,et al. Generalizing the Notion of Schema in Genetic Algorithms , 1991, Artif. Intell..
[5] Michael D. Vose,et al. The simple genetic algorithm - foundations and theory , 1999, Complex adaptive systems.
[6] Alden H. Wright,et al. Exact Results From A Coarse Grained Formulation Of The Dynamics Of Variable-length Genetic Algorithms , 2002, GECCO.
[7] C. Stephens. Some exact results from a coarse grained formulation of genetic dynamics , 2001, nlin/0105029.
[8] M. Eigen. Selforganization of matter and the evolution of biological macromolecules , 1971, Naturwissenschaften.
[9] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[10] H. Geiringer. On the Probability Theory of Linkage in Mendelian Heredity , 1944 .
[11] Nicholas J. Radcliffe,et al. The algebra of genetic algorithms , 1994, Annals of Mathematics and Artificial Intelligence.
[12] A. Wright,et al. Form Invariance and Implicit Parallelism , 2001, Evolutionary Computation.
[13] Christopher R. Stephens,et al. Landscapes and Effective Fitness , 2003 .
[14] Melanie Mitchell,et al. Finite populations induce metastability in evolutionary search , 1997 .