Introduction | p. 1 |
An Experimental Design Perspective on Genetic Algorithms | p. 7 |
The Schema Theorem and Price's Theorem | p. 23 |
Fitness Variance of Formae and Performance Prediction | p. 51 |
The Troubling Aspects of a Building Block Hypothesis for Genetic Programming | p. 73 |
Order Statistics for Convergence Velocity Analysis of Simplified Evolutionary Algorithms | p. 91 |
Stability of Vertex Fixed Points and Applications | p. 103 |
Using Markov Chains to Analyze GAFOs | p. 115 |
Predictive Models Using Fitness Distributions of Genetic Operators | p. 139 |
Modeling Simple Genetic Algorithms for Permutation Problems | p. 163 |
Population Size and Genetic Drift in Fitness Sharing | p. 185 |
An Approach to the Study of Sensitivity for a Class of Genetic Algorithms | p. 225 |
Genetic Algorithm Difficulty and the Modality of Fitness Landscapes | p. 243 |
Greedy Recombination and Genetic Search on the Space of Computer Programs | p. 271 |
Productive Recombination and Propagating and Preserving Schemata | p. 299 |
The Role of Development in Genetic Algorithms | p. 315 |
Author Index | p. 333 |
Key Word Index | p. 335 |
Table of Contents provided by Blackwell. All Rights Reserved. |