Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Antonisse, J. (1989). A new interpretation of schema notation that overturns the binary encoding constraint. In Ed. J. D. Schaffer Procedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, pages 86–97.
2. Booker, L. (1993). Recombination distributions for genetic algorithms. In L. Darrell Whitley, editor, Foundations of Genetic Algorithms 2, pages 29–44, Morgan Kaufmann.
3. Geiringer, H. (1944). On the probability of linkage in Mendelian heredity. Annals of Mathematical Statistics, 15:25–57.
4. Coffey, S. (1999) An Applied Probabilist’s Guide to Genetic Algorithms. A Thesis Submitted to The University of Dublin for the degree of Master in Science.
5. Liepins, G. and Vose, M. (1992). Characterizing Crossover in Genetic Algorithms. Annals of Mathematics and Artificial Intelligence, 5: 27–34.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献