Suchen und Finden
Front Cover
1
Foundations of Genetic Algorithms•6
4
Copyright Page
5
Contents
8
Chapter 1. Introduction
10
Chapter 2. Overcoming Fitness Barriers in Multi-Modal Search Spaces
14
Chapter 3. Niches in NK-Landscapes
36
Chapter 4. New Methods for Tunable, Random Landscapes
56
Chapter 5. Analysis of Recombinative Algorithms on a Non-Separable Building-Block Problem
78
Chapter 6. Direct Statistical Estimation of GA Landscape Properties
100
Chapter 7. Comparing Population Mean Curves
118
Chapter 8. Local Performance of the ((/(I, () -ES in a Noisy Environment
136
Chapter 9. Recursive Conditional Scheme Theorem, Convergence and Population Sizing in Genetic Algorithms
152
Chapter 10. Towards a Theory of Strong Overgeneral Classifiers
174
Chapter 11. Evolutionary Optimization through PAC Learning
194
Chapter 12. Continuous Dynamical System Models of Steady-State Genetic Algorithms
218
Chapter 13. Mutation-Selection Algorithm: A Large Deviation Approach
236
Chapter 14. The Equilibrium and Transient Behavior of Mutation and Recombination
250
Chapter 15. The Mixing Rate of Different Crossover Operators
270
Chapter 16. Dynamic Parameter Control in Simple Evolutionary Algorithms
284
Chapter 17. Local Search and High Precision Gray Codes: Convergence Results and Neighborhoods
304
Chapter 18. Burden and Benefits of Redundancy
322
Author Index
344
Key Word Index
346
Alle Preise verstehen sich inklusive der gesetzlichen MwSt.