Next: About this document ...
Up: How long are Long
Previous: What is Total Variation
- Bäck1996
-
Thomas Bäck.
Evolutionary Algorithms in Theory and Practice: Evolution
Strategies, Evolutionary Programming, Genetic Algorithms.
Oxford University Press, New York, 1996.
- Banzhaf et al.1998
-
Wolfgang Banzhaf, Peter Nordin, Robert E. Keller, and Frank D. Francone.
Genetic Programming - An Introduction; On the Automatic
Evolution of Computer Programs and its Applications.
Morgan Kaufmann, 1998.
- Blickle1996
-
Tobias Blickle.
Theory of Evolutionary Algorithms and Application to System
Synthesis.
PhD thesis, Swiss Federal Institute of Technology, Zurich, November
1996.
- Diaconis1988
-
Persi Diaconis.
Group Representations in Probability and Statistics, volume 11
of Lecture notes-Monograph Series.
Institute of Mathematical Sciences, Hayward, California, 1988.
- Gao1998
-
Yong Gao.
An upper bound on the convergence rates of canonical genetic
algorithms.
Complexity International, 5, 1998.
- Garnier et al.1999
-
Josselin Garnier, Leila Kallel, and Marc Schoenauer.
Rigorous hitting times for binary mutations.
Evolutionary Computation, 7(2):173-203, 1999.
- Langdon and Poli2002
-
W. B. Langdon and Riccardo Poli.
Foundations of Genetic Programming.
Springer-Verlag, 2002.
- Rosenthal1995
-
Jeffrey S. Rosenthal.
Convergence rates for Markov chains.
SIAM Review, 37(3):387-405, 1995.
- Teller1994
-
Astro Teller.
Genetic programming, indexed memory, the halting problem, and other
curiosities.
In Proceedings of the 7th annual Florida Artificial Intelligence
Research Symposium, pages 270-274, Pensacola, Florida, USA, May 1994. IEEE
Press.
- Wolpert and
Macready1997
-
David H. Wolpert and William G. Macready.
No free lunch theorems for optimization.
IEEE Transactions on Evolutionary Computation, 1(1):67-82,
April 1997.
Next: About this document ...
Up: How long are Long
Previous: What is Total Variation
Bill LANGDON
2002-07-17 (patched 21 Mar 2021)