A Field Guide to Genetic ProgrammingGenetic programming (GP) is a systematic, domain-independent method for getting computers to solve problems automatically starting from a high-level statement of what needs to be done. Using ideas from natural evolution, GP starts from an ooze of random computer programs, and progressively refines them through processes of mutation and sexual recombination, until high-fitness solutions emerge. All this without the user having to know or specify the form or structure of solutions in advance. GP has generated a plethora of human-competitive results and applications, including novel scientific discoveries and patentable inventions. This unique overview of this exciting technique is written by three of the most active scientists in GP. See www.gp-field-guide.org.uk for more information on the book. |
From inside the book
Results 1-5 of 92
Page v
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Page xi
... . . . . . . . . 27 4 Example Genetic Programming Run 29 4.1 Preparatory Steps . . . . . . . . . . . . . . . . . . . . . . . . 29 4.2 Step-by-Step Sample Run . . . . . . . . . . . . . . . . . . . . 31 4.2.1 Initialisation ...
... . . . . . . . . 27 4 Example Genetic Programming Run 29 4.1 Preparatory Steps . . . . . . . . . . . . . . . . . . . . . . . . 29 4.2 Step-by-Step Sample Run . . . . . . . . . . . . . . . . . . . . 31 4.2.1 Initialisation ...
Page 2
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Page 9
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Page 10
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Contents
Introduction | 1 |
I Basics | 7 |
II Advanced Genetic Programming | 37 |
III Practical Genetic Programming | 109 |
IV Tricks of the Trade | 143 |
Common terms and phrases
Advances algorithms applications approach automatically bloat chapter common Computer Science Conference constant created crossover depth distribution editors effects et al evaluation evolution Evolutionary Computation evolved example execution Figure fitness fitness function function Genetic Algorithms Genetic and Evolutionary genetic programming GP system GPBiB IEEE implementation important individuals initial Intelligence International ISBN ISSN J. R. Koza July June learning limit linear LNCS machine method Morgan Kaufmann mutation Nature node Notes objectives operators parallel parent performance Poli population possible Practice Press primitive probability problem Proceedings produce random randomly representation represented selection simple solution solve SP SP SP space Springer Springer-Verlag structure subtree techniques terminal theory tion tree typically University variables volume W. B. Langdon