An Introduction to Genetic Algorithms - Boente
An Introduction to Genetic Algorithms - Boente
An Introduction to Genetic Algorithms - Boente
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Appendix B: Other Resources<br />
Mitchell, M., Holland, J. H., and Forrest, S. 1994. When will a genetic algorithm outperform hill climbing? In<br />
J. D. Cowan, G. Tesauro, and J. Alspec<strong>to</strong>r, eds., Advances in Neural Information Processing Systems 6.<br />
Morgan Kaufmann.<br />
Mitchell, M., Hraber, P. T., and Crutchfield, J. P. 1993. Revisiting the edge of chaos: Evolving cellular<br />
au<strong>to</strong>mata <strong>to</strong> perform computations. Complex Systems 7, 89–130.<br />
Montana, D. J., and L. D. Davis 1989. Training feedforward networks using genetic algorithms. In<br />
Proceedings of the International Joint Conference on Artificial Intelligence. Morgan Kaufmann.<br />
Mühlenbein, H. 1992. How genetic algorithms really work: 1. Mutation and hillclimbing. In R. Männer and B.<br />
Manderick, eds., Parallel Problem Solving from Nature 2. North−Holland.<br />
Nilsson, N. J. 1989. Action networks. In J. Tenenberg et al., eds.,Proceedings from the Rochester Planning<br />
Workshop: From Formal Systems <strong>to</strong> Practical Systems, Technical Report 284, University of Rochester<br />
Computer Science Department, (N.Y.).<br />
Nix, A. E., and Vose, M. D. 1991. Modeling genetic algorithms with Markov chains. <strong>An</strong>nals of Mathematics<br />
and Artificial Intelligence 5: 79–88.<br />
O'Reilly, U. −M., and Oppacher, F. 1992. <strong>An</strong> experimental perspective on genetic programming. In R.<br />
Männer and B. Manderick, eds., Parallel Problem Solving from Nature 2. NorthHolland.<br />
O'Reilly, U. −M, and Oppacher, F. 1994a. Program search with a hierarchical variable length representation:<br />
<strong>Genetic</strong> programming, simulated annealing, and hill climbing. In Y. Davidor, H. −P. Schwefel, and R.<br />
Männer, eds., Parallel Problem Solving from Nature—PPSN III. SpringerVerlag (Lecture Notes in Computer<br />
Science, Volume 866).<br />
O'Reilly, U. −M., and Oppacher, F. 1994b. Program search with a hierarchical variable length representation:<br />
<strong>Genetic</strong> programming, simulated annealing, and hill climbing. In Y. Davidor, H. −P. Schwefel, and R.<br />
Männer, eds., Parallel Problem Solving from Nature—PPSN III. SpringerVerlag (Lectures Notes in Computer<br />
Science, Volume 866).<br />
O'Reilly, U. −M., and Oppacher, F. 1995. The troubling aspects of a building block hypothesis for genetic<br />
programming. In L. D. Whitley and M. D. Vose, eds.,Foundations of <strong>Genetic</strong> <strong>Algorithms</strong> 3. Morgan<br />
Kaufmann.<br />
Osborne, H. F. 1896. A mode of evolution requiring neither natural selection nor the inheritance of acquired<br />
characteristics. Transactions of the New York Academy of Science 15: 141–142, 148.<br />
154