On the limiting distribution of program sizes in tree-based genetic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4445 LNCS, Issue , 2007, Pages 193-204

  Poli, Riccardo ^a   Langdon, William B ^a   Dignum, Stephen ^a  

^a UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; DISTRIBUTION FUNCTIONS; NUMBER THEORY; POPULATION DYNAMICS; PROBLEM SOLVING;

CROSSOVER POINTS; INTERNAL NODES; PROGRAM SIZES; SUB-TREE CROSSOVER;

GENETIC PROGRAMMING;

EID: 34548091371     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-71605-1_18     Document Type: Conference Paper

References (17)

1. T. Blickle and L. Thiele. A mathematical analysis of tournament selection. In L. J. Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms (ICGA '95), pages 9-16, San Francisco, California, 1995. Morgan Kaufmann Publishers.
2. T. Blickle and L. Thiele. A comparison of selection schemes used in evolutionary algorithms. Evolutionary Computation, 4(4):361-394, 1997.
3. P. C. Consul and L. R. Shenton. Use of Lagrange Expansion for Generating Discrete Generalized Probability Distributions. SIAM Journal on Applied Mathematics, 23(2):239-248, 1972.
4. H. Geiringer. On the probability theory of linkage in Mendelian heredity. Annals of Mathematical Statistics, 15(1):25-57, March 1944.
5. D. E. Goldberg and K. Deb. A comparative analysis of selection schemes used in genetic algorithms. In G. J. E. Rawlins, editor, Foundations of Genetic Algorithms. Morgan Kaufmann Publishers, 1991.
6. I. J. Good. The Lagrange Distributions and Branching Processes. SIAM Journal on Applied Mathematics, 28(2)-.270-275, 1975.
7. P. Hilton and J. Pederson. Catalan numbers, their generalization, and their uses. Mathematical Intelligencer, 13:64-75, 1991.
8. K. Janardan. Weighted Lagrange Distributions and Their Characterizations. SIAM Journal on Applied Mathematics, 47(2):411-415, 1987.
9. K. Janardan and B. Rao. Lagrange Distributions of the Second Kind and Weighted Distributions. SIAM Journal on Applied Mathematics, 43(2):302-313, 1983.
10. S. Luke. Two fast tree-creation algorithms for genetic programming. IEEE Transactions on Evolutionary Computation, 4(3):274-283, Sept. 2000.
11. T. Motoki. Calculating the expected loss of diversity of selection schemes. Evolutionary Computation, 10(4):397-422, 2002.
12. R. Poli and N. F. McPhee. Exact schema theorems for GP with one-point and standard crossover operating on linear structures and their application to the study of the evolution of size. In J. F. Miller, M. Tomassini, P. L. Lanzi, C. Ryan, A. G. B. Tettamanzi, and W. B. Langdon, editors, Genetic Programming, Proceedings of EuroGP'2001, volume 2038 of LNCS, pages 126-142, Lake Como, Italy, 18-20 Apr. 2001. Springer-Verlag.
13. R. Poli and N. F. McPhee. General schema theory for genetic programming with subtree-swapping crossover: Part I. Evolutionary Computation, 11(1):53-66, Mar. 2003.
14. R. Poli and N. F. McPhee. General schema theory for genetic programming with subtree-swapping crossover: Part II. Evolutionary Computation, 11(2):169-206, June 2003.
15. J. E. Rowe and N. F. McPhee. The effects of crossover and mutation operators on variable length linear structures. Technical Report CSRP-01-7, University of Birmingham, School of Computer Science, Jan. 2001.
16. M. D. Vose. The simple genetic algorithm: Foundations and theory. MIT Press, Cambridge, MA, 1999.
17. H. W. Watson and F. Galton. On the Probability of the Extinction of Families. The Journal of the Anthropological Institute of Great Britain and Ireland, 4:138-144, 1875.