Progress population genetics and human evolution

196 FRONTIERS OF EVOLUTIONARY COMPUTATION

In Grefenstette, J. J., editor, Genetic Algorithms and Their Applications: Proceedings of the Second International Conference on Genetic Algorithms. Lawrence Erlbaum Publishers.

Banzhaf, W., Francone, F. D., and Nordin, P. (1996). The Effect of Extensive Use of the Mutation Operator on Generalization in Genetic Programming using Sparse Data Sets. In Ebeling, W., Rechenberg, I., Schwefel, H. P., and Voigt, H. M., editors, 4th International. Conference. on Parallel Problem Solving from Nature (PPSN96), pages 300–309. Springer Verlag.

Catoni, O. (1991a). Applications of Sharp Large Deviations Estimates to Opti­

mal Cooling Schedules. Annales de		Institute Henri Poincaré. Probabilités

Cerf, R. (1998). Asymptotic Convergence of Genetic Algorithms. Advances in Applied Probability, 30:521–550.

REFERENCES 197

Droste, S., Jansen, T., and Wegener, I. (2002). On the Analysis of the (1 + 1) Evolutionary Algorithm. Theoretical Computer Science, 276:51–81.

Feller, W. (1968). An Introduction to Probability Theory and Its Applications. Volume 1. John Wiley & Sons Publishers. (third edition).

Goldberg, D. E. (1990). A Note on Boltzmann Tournament Selection for Ge­netic Algorithms and Population Oriented Simulated Annealing. Complex Systems, 4:445–460.

Goldberg, D. E. and Deb, K. (1991). A Comparative Analysis of Selection Schemes used in Genetic Algorithms. In Rawlins, G. J. E., editor, Founda­ tions of Genetic Algorithms, pages 69–93. Morgan Kaufmann Publishers. Greenwood, G. W. and Zhu, Q. J. (2001). Convergence in Evolutionary Pro­ grams with Self-Adaptation. Evolutionary Computation, 9:147–157.