General Schema Theory for Genetic Programming with Subtree ...

General Schema Theory for GP: Part II
Poli, R. and Langdon, W. B. (1998). Schema theory for genetic programming with onepoint
crossover and point mutation. Evolutionary Computation, 6(3):231–252.
Poli, R., Langdon, W. B., and O’Reilly, U.-M. (1998). Analysis of schema variance and
short term extinction likelihoods. In Koza, J. R., Banzhaf, W., Chellapilla, K., Deb,
K., Dorigo, M., Fogel, D. B., Garzon, M. H., Goldberg, D. E., Iba, H., and Riolo, R.,
editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages
284–292, University of Wisconsin, Madison, Wisconsin, USA. Morgan Kaufmann.
Poli, R. and McPhee, N. F. (2001a). Exact GP schema theory for headless chicken
crossover and subtree mutation. In Proceedings of the 2001 Congress on Evolutionary
Computation CEC2001, pages 1062–1069, COEX, World Trade Center, 159
Samseong-dong, Gangnam-gu, Seoul, Korea. IEEE Press.
Poli, R. and McPhee, N. F. (2001b). 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 Miller, J. F., Tomassini, M., Lanzi, P. L., Ryan, C.,
Tettamanzi, A. G. B., and Langdon, W. B., editors, Genetic Programming, Proceedings
of EuroGP’2001, volume 2038 of LNCS, pages 126–142, Lake Como, Italy. Springer-
Verlag.
Poli, R. and McPhee, N. F. (2001c). Exact schema theory for GP and variable-length
GAs with homologous crossover. In Spector, L., Goodman, E. D., Wu, A., Langdon,
W. B., Voigt, H.-M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M. H., and
Burke, E., editors, Proceedings of the Genetic and Evolutionary Computation Conference
(GECCO-2001), pages 104–111, San Francisco, California, USA. Morgan Kaufmann.
Poli, R. and McPhee, N. F. (2003). General schema theory for genetic programming
with subtree-swapping crossover: Part I. Evolutionary Computation, 11(1):53–66.
Poli, R., Rowe, J. E., and McPhee, N. F. (2001). Markov chain models for GP and
variable-length GAs with homologous crossover. In Spector, L., Goodman, E. D.,
Wu, A., Langdon, W. B., Voigt, H.-M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S.,
Garzon, M. H., and Burke, E., editors, Proceedings of the Genetic and Evolutionary
Computation Conference (GECCO-2001), pages 112–119, San Francisco, California,
USA. Morgan Kaufmann.
Poli, R., Rowe, J. E., Stephens, C. R., and Wright, A. H. (2002). Allele diffusion in
linear genetic programming and variable-length genetic algorithms with subtree
crossover. In Foster, J. A., Lutton, E., Miller, J., Ryan, C., and Tettamanzi, A. G. B.,
editors, Genetic Programming, Proceedings of the 5th European Conference, EuroGP
2002, volume 2278 of LNCS, pages 212–227, Kinsale, Ireland. Springer-Verlag.
Prügel-Bennett, A. and Shapiro, J. L. (1994). An analysis of genetic algorithms using
statistical mechanics. Physical Review Letters, 72:1305–1309.
Radcliffe, N. J. (1997). Schema processing. In Baeck, T., Fogel, D. B., and Michalewicz,
Z., editors, Handbook of Evolutionary Computation, pages B2.5–1–10. Oxford University
Press.
Rosca, J. P. (1997). Analysis of complexity drift in genetic programming. In Koza, J. R.,
Deb, K., Dorigo, M., Fogel, D. B., Garzon, M., Iba, H., and Riolo, R. L., editors,
Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 286–
294, Stanford University, CA, USA. Morgan Kaufmann.
Evolutionary Computation Volume ?, Number ? 37