Genetic programming II Book

	Preface
	Acknowledgments
1	Introduction	1
2	Background on Genetic Algorithms, LISP, and Genetic Programming	21
3	Hierarchical Problem-Solving	45
4	Introduction to Automatically Defined Functions - The Two-Boxes Problem	57
5	Problems that Straddle the Breakeven Point for Computational Effort	109
6	Boolean Parity Functions	157
7	Determining the Architecture of the Program	201
8	The Lawnmower Problem	225
9	The Bumblebee Problem	275
10	The Increasing Benefits of ADFs as Problems are Scaled Up	301
11	Finding an Impulse Response Function	307
12	Artificial Ant on the San Mateo Trail	349
13	Obstacle-Avoiding Robot	365
14	The Minesweeper Problem	377
15	Automatic Discovery of Detectors for Letter Recognition	389
16	Flushes and Four-of-a-Kinds in a Pinochle Deck	417
17	Introduction to Biochemistry and Molecular Biology	429
18	Prediction of Transmembrane Domains in Proteins	445
19	Prediction of Omega Loops in Proteins	493
20	Lookahead Version of the Transmembrane Problem	505
21	Evolutionary Selection of the Architecture of the Program	525
22	Evolution of Primitives and Sufficiency	575
23	Evolutionary Selection of Terminals	597
24	Evolution of Closure	601
25	Simultaneous Evolution of Architecture, Primitive Functions, Terminals, Sufficiency, and Closure	611
26	The Role of Representation and the Lens Effect	619
27	Conclusion	643
	Appendix A: List of Special Symbols	647
	Appendix B: List of Special Functions	651
	Appendix C: List of Type Fonts	653
	Appendix D: Default Parameters	655
	Appendix E: Computer Implementation	661
	Appendix F: Annotated Bibliography of Genetic Programming	697
	Appendix G: Electronic Mailing List and Public Repository	717
	Bibliography	719
	Index	735