# Theoretical results in genetic programming: the next ten years?

- 395 Downloads
- 20 Citations

## Abstract

We consider the theoretical results in GP so far and prospective areas for the future. We begin by reviewing the state of the art in genetic programming (GP) theory including: schema theories, Markov chain models, the distribution of functionality in program search spaces, the problem of bloat, the applicability of the no-free-lunch theory to GP, and how we can estimate the difficulty of problems before actually running the system. We then look at how each of these areas might develop in the next decade, considering also new possible avenues for theory, the challenges ahead and the open issues.

## Keywords

Genetic programming Theory Challenges Open problems## Notes

### Acknowledgments

The authors would like to thank Julian Miller and the referees of this paper for their extremely useful feedback. Lee Spector is also gratefully thanked.

## References

- 1.J.R. Koza,
*Genetic Programming: On the Programming of Computers by Means of Natural Selection*(MIT Press, Cambridge, MA, 1992)MATHGoogle Scholar - 2.J.R. Koza,
*Genetic Programming II: Automatic Discovery of Reusable Programs*(MIT Press, Cambridge MA, May 1994)MATHGoogle Scholar - 3.W. Banzhaf, P. Nordin, R.E. Keller, F.D. Francone,
*Genetic Programming—An Introduction; On the Automatic Evolution of Computer Programs and its Applications*(Morgan Kaufmann, San Francisco, CA, 1998)MATHGoogle Scholar - 4.W.B. Langdon, R. Poli,
*Foundations of Genetic Programming*(Springer, Berlin, 2002)MATHGoogle Scholar - 5.R. Poli, W.B. Langdon, N.F. McPhee, A field guide to genetic programming (2008). Published via http://lulu.com and freely available at http://www.gp-field-guide.org.uk (with contributions by J. R. Koza).
- 6.R. Poli, Exact schema theory for genetic programming and variable-length genetic algorithms with one-point crossover. Genet. Program. Evol. Mach.
**2**, 23–163, (2001)MATHCrossRefGoogle Scholar - 7.N.F. McPhee, R. Poli, J.E. Rowe, A schema theory analysis of mutation size biases in genetic programming with linear representations. in
*Proceedings of the 2001 Congress on Evolutionary Computation CEC2001*, (COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea), (IEEE Press, 27–30 May 2001) pp. 1078–1085Google Scholar - 8.R. Poli, N.F. McPhee, General schema theory for genetic programming with subtree-swapping crossover: Part I. Evol. Comput.
**11**, 53–66 (2003)CrossRefGoogle Scholar - 9.R. Poli, N.F. McPhee, General schema theory for genetic programming with subtree-swapping crossover: Part II. Evol. Comput.
**11**, 169–206 (2003)CrossRefGoogle Scholar - 10.R. Poli, N.F. McPhee, J.E. Rowe, Exact schema theory and Markov chain models for genetic programming and variable-length genetic algorithms with homologous crossover. Genet. Program. Evol. Mach.
**5**, 31–70 (2004)CrossRefGoogle Scholar - 11.J.F. Miller, An empirical study of the efficiency of learning boolean functions using a cartesian genetic programming approach. in
*Proceedings of the Genetic and Evolutionary Computation Conference*, ed. by W. Banzhaf, J. Daida, A.E. Eiben, M.H. Garzon, V. Honavar, M. Jakiela, R.E. Smith. vol. 2 (Morgan Kaufmann, Orlando, FL, 13–17 July 1999), pp. 1135–1142Google Scholar - 12.J.F. Miller, P. Thomson, Cartesian genetic programming. in
*Genetic Programming, Proceedings of EuroGP’2000*, ed. by R. Poli, W. Banzhaf, W.B. Langdon, J.F. Miller, P. Nordin, T.C. Fogarty. LNCS, vol. 1802, (Springer, Edinburgh, 15–16 April 2000), pp. 121–132Google Scholar - 13.C. Ryan, J.J. Collins, M. O’Neill, Grammatical evolution: Evolving programs for an arbitrary language. in
*Proceedings of the First European Workshop on Genetic Programming*, ed. by W. Banzhaf, R. Poli, M. Schoenauer, T.C. Fogarty. LNCS, vol. 1391, (Springer, Paris, 14–15 April 1998), pp. 83–95Google Scholar - 14.M. O’Neill, C. Ryan, Grammatical evolution. IEEE Trans. Evol. Comput.
**5**, 349–358 (2001)CrossRefGoogle Scholar - 15.L.J. Fogel, A.J. Owens, M.J. Walsh,
*Artificial Intelligence Through Simulated Evolution*(Wiley, New York, 1966)MATHGoogle Scholar - 16.R. Poli, C.R. Stephens, The building block basis for genetic programming and variable-length genetic algorithms. Int. J. Comput. Intell. Res.
**1**(2), 183–197 (2005)Google Scholar - 17.R.L. Riolo, U.-M. O’Reilly, T. McConaghy (eds.),
*Genetic Programming Theory and Practice VII*, Genetic and Evolutionary Computation, (Ann Arbor, Springer, 14–16 May 2009)Google Scholar - 18.J.H. Holland,
*Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence*(MIT Press, Cambridge, 1992). First Published by University of Michigan Press 1975Google Scholar - 19.D. Whitley, A genetic algorithm tutorial. Stat. Comput.
**4**, 65–85 (1994)CrossRefGoogle Scholar - 20.C.R. Stephens, H. Waelbroeck, Effective degrees of freedom in genetic algorithms and the block hypothesis. in
*Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA97)*, ed. by T.Bäck (Morgan Kaufmann, East Lansing, 1997), pp. 34–40Google Scholar - 21.C.R. Stephens and H. Waelbroeck, Schemata evolution and building blocks. Evol. Comput.
**7**(2), 109–124 (1999)CrossRefGoogle Scholar - 22.L. Altenberg, Emergent phenomena in genetic programming. in
*Evolutionary Programming—Proceedings of the Third Annual Conference*, ed. by A.V. Sebald, L.J. Fogel, (World Scientific Publishing, San Diego, CA, 24–26 Feb 1994), pp. 233–241Google Scholar - 23.U.-M. O’Reilly, F. Oppacher, The troubling aspects of a building block hypothesis for genetic programming. in
*Foundations of Genetic Algorithms 3*, ed. by L.D. Whitley, M.D. Vose. (Morgan Kaufmann, Estes Park, CO, 31 July–2 Aug 1994), pp. 73–88, Published 1995Google Scholar - 24.P.A. Whigham, A schema theorem for context-free grammars. in
*1995 IEEE Conference on Evolutionary Computation*, vol. 1, (IEEE Press, Perth, Australia, 29 Nov–1 Dec 1995), pp. 178–181Google Scholar - 25.R. Poli, W.B. Langdon, A new schema theory for genetic programming with one-point crossover and point mutation. in
*Genetic Programming 1997: Proceedings of the Second Annual Conference*, ed. by J.R. Koza, K. Deb, M. Dorigo, D.B. Fogel, M. Garzon, H. Iba, R.L. Riolo. (Morgan Kaufmann, Stanford University, CA, 13–16 July 1997), pp. 278–285Google Scholar - 26.J.P. Rosca, Analysis of complexity drift in genetic programming. in
*Genetic Programming 1997: Proceedings of the Second Annual Conference*, ed. by J.R. Koza, K. Deb, M. Dorigo, D.B. Fogel, M. Garzon, H. Iba, R.L. Riolo. (Morgan Kaufmann, Stanford University, CA, 13–16 July 1997), pp. 286–294Google Scholar - 27.R. Poli, Hyperschema theory for GP with one-point crossover, building blocks, and some new results in GA theory. in
*Genetic Programming, Proceedings of EuroGP’2000*, ed. by R. Poli, W. Banzhaf, W.B. Langdon, J.F. Miller, P. Nordin, T.C. Fogarty. LNCS, vol. 1802, (Springer, Edinburgh, 15–16 April 2000), pp. 163–180Google Scholar - 28.R. Poli, Exact schema theorem and effective fitness for GP with one-point crossover. in
*Proceedings of the Genetic and Evolutionary Computation Conference*, ed. by D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, H.-G. Beyer. (Morgan Kaufmann, Las Vegas, July 2000), pp. 469–476Google Scholar - 29.R. Poli, Exact schema theory for genetic programming and variable-length genetic algorithms with one-point crossover. Genet. Program. Evol. Mach.
**2**(2), pp. 123–163 (2001)MATHCrossRefMathSciNetGoogle Scholar - 30.T.E. Davis, J.C. Principe, A Markov chain framework for the simple genetic algorithm. Evol. Comput.
**1**(3), pp. 269–288 (1993)CrossRefGoogle Scholar - 31.B. Mitavskiy, J. Rowe, Some results about the Markov chains associated to GPs and to general EAs. Theor. Comput. Sci.
**361**, pp. 72–110 (2006)MATHCrossRefMathSciNetGoogle Scholar - 32.W.B. Langdon, Convergence rates for the distribution of program outputs. in
*GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference*, ed. by W.B. Langdon, E. Cantú-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M.A. Potter, A.C. Schultz, J.F. Miller, E. Burke, N. Jonoska. (Morgan Kaufmann, New York, 9–13 July 2002), pp. 812–819Google Scholar - 33.W.B. Langdon, How many good programs are there? How long are they? in
*Foundations of Genetic Algorithms VII*, ed. by K.A. De Jong, R. Poli, J.E. Rowe (Morgan Kaufmann, Torremolinos, Spain, 4–6 Sept 2002), pp. 183–202, Published 2003Google Scholar - 34.W.B. Langdon, The distribution of reversible functions is Normal. in
*Genetic Programming Theory and Practise*, ed. by R.L. Riolo, B. Worzel (Kluwer, Dordrecht, 2003) Chap. 11, pp. 173–188Google Scholar - 35.W.B. Langdon, Convergence of program fitness landscapes. in
*Genetic and Evolutionary Computation—GECCO-2003*, ed. by E. Cantú-Paz, J.A. Foster, K. Deb, D. Davis, R. Roy, U.-M. O’Reilly, H.-G. Beyer, R. Standish, G. Kendall, S. Wilson, M. Harman, J. Wegener, D. Dasgupta, M.A. Potter, A.C. Schultz, K. Dowsland, N. Jonoska, J. Miller. LNCS, vol. 2724, (Springer, Chicago, 12–16 July 2003), pp. 1702–1714Google Scholar - 36.W.B. Langdon, The distribution of amorphous computer outputs. in
*The Grand Challenge in Non-Classical Computation: International Workshop*, ed. by S. Stepney, S. Emmott (York, UK 18–19 April 2005).Google Scholar - 37.R. Poli and W.B. Langdon, Efficient Markov chain model of machine code program execution and halting. in
*Genetic Programming Theory and Practice IV*, ed. by R.L. Riolo, T. Soule, B. Worzel (Ann Arbor: Springer, 11–13 May 2006), vol. 5 of*Genetic and Evolutionary Computation*, Chap. 13Google Scholar - 38.J. Woodward, Evolving turing complete representations. in
*Proceedings of the 2003 Congress on Evolutionary Computation CEC2003*, ed. by R. Sarker, R. Reynolds, H. Abbass, K.C. Tan, B. McKay, D. Essam, T. Gedeon (IEEE Press, Canberra, 8–12 Dec 2003), pp. 830–837Google Scholar - 39.N.F. McPhee, B. Ohs, T. Hutchison, Semantic building blocks in genetic programming. in
*Proceedings of the 11th European Conference on Genetic Programming, EuroGP 2008*, ed. by M. O’Neill, L. Vanneschi, S. Gustafson, A.I. Esparcia Alcazar, I. De Falco, A. Della Cioppa, E. Tarantino. Lecture Notes in Computer Science, vol. 4971(Springer, Naples, 26–28 Mar. 2008), pp. 134–145Google Scholar - 40.J.R. Woodward, R. Bai, Canonical representation genetic programming. in
*GEC ’09: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation*, ed. by L. Xu, E.D. Goodman, G. Chen, D. Whitley, Y. Ding. (ACM, Shanghai, China, 12–14 June 2009), pp. 585–592Google Scholar - 41.W.A. Tackett, Recombination, Selection, and the Genetic Construction of Computer Programs. PhD thesis, University of Southern California, 1994Google Scholar
- 42.N.F. McPhee, J.D. Miller, Accurate replication in genetic programming. In
*Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95)*, ed. by L. Eshelman. (Morgan Kaufmann, Pittsburgh, PA, 15–19 July 1995), pp. 303–309Google Scholar - 43.P. Nordin, W. Banzhaf, Complexity compression and evolution. in
*Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95)*, ed. by L. Eshelman. (Morgan Kaufmann, Pittsburgh, PA, 15–19 July 1995), pp. 310–317Google Scholar - 44.T. Blickle, L. Thiele, Genetic programming and redundancy. in
*Genetic Algorithms within the Framework of Evolutionary Computation (Workshop at KI-94, Saarbrücken)*, ed. by J. Hopf. (Im Stadtwald, Building 44, D-66123 Saarbrücken, Germany), pp. 33–38, Max-Planck-Institut für Informatik (MPI-I-94-241), 1994Google Scholar - 45.T. Soule, J.A. Foster, Removal bias: A new cause of code growth in tree based evolutionary programming. in
*1998 IEEE International Conference on Evolutionary Computation*, (IEEE Press, Anchorage, AK, 5–9 May 1998), pp. 781–786Google Scholar - 46.W.B. Langdon, R. Poli, Fitness causes bloat. in
*Soft Computing in Engineering Design and Manufacturing*, ed. by P.K. Chawdhry, R. Roy, R.K. Pant (Springer, London, 23–27 June 1997), pp. 13–22Google Scholar - 47.W.B. Langdon, T. Soule, R. Poli, J.A. Foster, The evolution of size and shape. in
*Advances in Genetic Programming 3*, ed. by L. Spector, W.B. Langdon, U.-M. O’Reilly, P.J. Angeline (MIT Press, Cambridge, MA, June 1999), Chap. 8, pp. 163–190Google Scholar - 48.W. Banzhaf, W.B. Langdon, Some considerations on the reason for bloat. Genet. Program. Evol. Mach.
**3**, pp. 81–91 (2002)MATHCrossRefGoogle Scholar - 49.J. Rosca, A probabilistic model of size drift. in
*Genetic Programming Theory and Practice*, ed. by R.L. Riolo, B. Worzel (Kluwer, Dordrecht, 2003), Chap. 8, pp. 119–136Google Scholar - 50.R. Poli, General schema theory for genetic programming with subtree-swapping crossover. in
*Genetic Programming, Proceedings of EuroGP 2001*, LNCS, vol. 2038, (Springer, Como, 18–20 April 2001)Google Scholar - 51.R. Poli, N.F. McPhee, Covariant parsimony pressure in genetic programming. Tech. Rep. CES-480, Department of Computing and Electronic Systems, University of Essex, Jan 2008Google Scholar
- 52.G.R. Price, Selection and covariance. Nature
**227**(5257), pp. 520–521 (1970)CrossRefGoogle Scholar - 53.W.B. Langdon,
*Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming!, vol. 1 of Genetic Programming*(Kluwer, Boston, 24 April 1998)Google Scholar - 54.R. Poli, W.B. Langdon, S. Dignum, On the limiting distribution of program sizes in tree-based genetic programming. in
*Proceedings of the 10th European Conference on Genetic Programming*, ed. by M. Ebner, M. O’Neill, A. Ekárt, L. Vanneschi, A.I. Esparcia-Alcázar. Lecture Notes in Computer Science, vol. 4445 (Springer, Valencia, Spain, 11– 13 April 2007), pp. 193–204Google Scholar - 55.S. Dignum, R. Poli, Generalisation of the limiting distribution of program sizes in tree-based genetic programming and analysis of its effects on bloat. in
*GECCO ’07: Proceedings of the 9th Annual Conference on Genetic and Evolutionary computation*, ed. by D. Thierens, H.-G. Beyer, J. Bongard, J. Branke, J.A. Clark, D. Cliff, C.B. Congdon, K. Deb, B. Doerr, T. Kovacs, S. Kumar, J.F. Miller, J. Moore, F. Neumann, M. Pelikan, R. Poli, K. Sastry, K.O. Stanley, T. Stutzle, R.A. Watson, I. Wegener (ACM Press, London, 7–11 July 2007), vol. 2, pp. 1588–1595Google Scholar - 56.S. Dignum, R. Poli, Sub-tree swapping crossover and arity histogram distributions. in
*Genetic Programming*, ed. by A.I. Esparcia-Alcázar, A. Ekárt, S. a Silva, S. Dignum, A. Şima Uyar. Lecture Notes in Computer Science, vol. 6021 (Springer, 2010), pp. 38–49Google Scholar - 57.T. Soule, J.A. Foster, Effects of code growth and parsimony pressure on populations in genetic programming. Evol. Comput.
**6**, pp. 293–309 (1998)CrossRefGoogle Scholar - 58.W.B. Langdon, Size fair and homologous tree genetic programming crossovers. Genet. Program. Evol. Mach.
**1**, pp. 95–119 (2000)MATHCrossRefGoogle Scholar - 59.B.-T. Zhang, H. Mühlenbein, Balancing accuracy and parsimony in genetic programming. Evol. Comput.
**3**(1), pp. 17–38 (1995)CrossRefGoogle Scholar - 60.B.-T. Zhang, H. Mühlenbein, Evolving optimal neural networks using genetic algorithms with Occam’s razor. Complex Syst.
**7**, pp. 199–220 (1993)Google Scholar - 61.B.-T. Zhang, P. Ohm, H. Mühlenbein, Evolutionary induction of sparse neural trees. Evol. Comput.
**5**(2), pp. 213–236 (1997)MATHCrossRefGoogle Scholar - 62.T. Soule, Code Growth in Genetic Programming. PhD thesis, University of Idaho, 15 May 1998Google Scholar
- 63.R. Poli, N.F. McPhee, Parsimony pressure made easy. in
*GECCO ’08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation*, (ACM, Atlanta, GA, 2008), pp. 1267–1274Google Scholar - 64.R. Poli, A simple but theoretically-motivated method to control bloat in genetic programming. in
*Genetic Programming, Proceedings of the 6th European Conference, EuroGP 2003*, ed. by C. Ryan, T. Soule, M. Keijzer, E. Tsang, R. Poli, E. Costa. LNCS, (Springer, Essex, UK, 14–16 April 2003), pp. 211–223Google Scholar - 65.R. Poli, Covariant Tarpeian method for bloat control in genetic programming. in
*Genetic Programming Theory and Practice VIII*. Genetic and Evolutionary Computation, ed. by R.L. Riolo et al. (Springer, Ann Arbor, 2010) (in press)Google Scholar - 66.S. Dignum, R. Poli, Operator equalisation and bloat free GP. in
*Proceedings of the 11th European Conference on Genetic Programming, EuroGP 2008*, ed. by M. O’Neill, L. Vanneschi, S. Gustafson, A.I. Esparcia Alcazar, I. De Falco, A. Della Cioppa, E. Tarantino. Lecture Notes in Computer Science, vol. 4971 (Springer, Naples, 26–28 March 2008), pp. 110–121Google Scholar - 67.S. Silva, S. Dignum, Extending operator equalisation: Fitness based self adaptive length distribution for bloat free GP. in
*Proceedings of the 12th European Conference on Genetic Programming, EuroGP 2009*, ed. by L. Vanneschi, S. Gustafson, A. Moraglio, I. De Falco, M. Ebner. LNCS, vol. 548 (Springer, Tuebingen, 15–17 April 2009), pp. 159–170Google Scholar - 68.S. Silva, L. Vanneschi, Operator equalisation, bloat and overfitting: A study on human oral bioavailability prediction. in
*GECCO ’09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation*, ed. by G. Raidl, F. Rothlauf, G. Squillero, R. Drechsler, T. Stuetzle, M. Birattari, C.B. Congdon, M. Middendorf, C. Blum, C. Cotta, P. Bosman, J. Grahl, J. Knowles, D. Corne, H.-G. Beyer, K. Stanley, J.F. Miller, J. van Hemert, T. Lenaerts, M. Ebner, J. Bacardit, M. O’Neill, M. Di Penta, B. Doerr, T. Jansen, R. Poli, E. Alba (ACM, Montreal, 8–12 July 2009), pp. 1115–1122Google Scholar - 69.D.E. Goldberg,
*Genetic Algorithms in Search, Optimization and Machine Learning*(Addison-Wesley, Boston, 1989)MATHGoogle Scholar - 70.J. Horn, D.E. Goldberg, Genetic algorithm difficulty and the modality of the fitness landscapes. in
*Foundations of Genetic Algorithms, 3*, ed. by D. Whitley, M. Vose (Morgan Kaufmann, Estes Park, CO, 1995), pp. 243–269Google Scholar - 71.M. Mitchell, S. Forrest, J. Holland, The royal road for genetic algorithms: Fitness landscapes and GA performance. in
*Toward a Practice of Autonomous Systems, Proceedings of the First European Conference on Artificial Life*, ed. by F.J. Varela, P. Bourgine (The MIT Press, Cambridge, MA, 1992), pp. 245–254Google Scholar - 72.S. Forrest, M. Mitchell, What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation. Mach. Learn.
**13**, pp. 285–319 (1993)CrossRefGoogle Scholar - 73.P.F. Stadler, Fitness landscapes. in
*Biological Evolution and Statistical Physics*, ed. by M.Lässig, Valleriani. Lecture Notes Physics, vol. 585, (Springer, Heidelberg, 2002), pp. 187–207Google Scholar - 74.K.E. Kinnear Jr., Fitness landscapes and difficulty in genetic programming. in
*Proceedings of the First IEEE Conference on Evolutionary Computing*(IEEE Press, Piscataway, NY, 1994), pp. 142–147Google Scholar - 75.N.I. Nikolaev, V. Slavov, Concepts of inductive genetic programming. in
*Genetic Programming, Proceedings of EuroGP’1998*, ed. by W. Banzhaf et al. LNCS, vol. 1391 (Springer, 1998), pp. 49–59Google Scholar - 76.T. Jones, Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico, Albuquerque, 1995.Google Scholar
- 77.L. Vanneschi, Theory and Practice for Efficient Genetic Programming. PhD thesis, Faculty of Sciences, University of Lausanne 2004Google Scholar
- 78.M. Tomassini, L. Vanneschi, P. Collard, M. Clergue, A study of fitness distance correlation as a difficulty measure in genetic programming. Evol. Comput.
**13**, pp. 213–239 (2005)CrossRefGoogle Scholar - 79.L. Vanneschi, M. Clergue, P. Collard, M. Tomassini, S. Vérel, Fitness clouds and problem hardness in genetic programming. in
*Genetic and Evolutionary Computation – GECCO-2004, Part II*ed. by K. Deb, R. Poli, W. Banzhaf, H.-G. Beyer, E. Burke, P. Darwen, D. Dasgupta, D. Floreano, J. Foster, M. Harman, O. Holland, P.L. Lanzi, L. Spector, A. Tettamanzi, D. Thierens, A. Tyrrell. Lecture Notes in Computer Science, vol. 3103 (Springer, Seattle, WA, 26–30 June 2004), pp. 690–701Google Scholar - 80.L. Vanneschi, M. Tomassini, P. Collard, S. Vérel, Negative slope coefficient. A measure to characterize genetic programming. in
*Proceedings of the 9th European Conference on Genetic Programming*, ed. by P. Collet, M. Tomassini, M. Ebner, S. Gustafson, A. Ekárt. Lecture Notes in Computer Science, vol. 3905 (Springer, Budapest, Hungary, 10–12 April 2006), pp. 178–189Google Scholar - 81.L. Vanneschi, Investigating problem hardness of real life applications. in
*Genetic Programming Theory and Practice V*. Genetic and Evolutionary Computation. ed. by R.L. Riolo, T. Soule, B. Worzel (Springer, Ann Arbor, 17–19 May 2007), Chap. 7, pp. 107–125Google Scholar - 82.S. Gustafson, L. Vanneschi, Operator-based distance for genetic programming: Subtree crossover distance. in
*Genetic Programming, 8th European Conference, EuroGP2005*, ed. by M. Keijzer et al. Lecture Notes in Computer Science, LNCS 3447 (Springer, Lausanne, Switzerland, 2005), pp. 178–189Google Scholar - 83.L. Vanneschi, S. Gustafson, G. Mauri, Using subtree crossover distance to investigate genetic programming dynamics. in
*Genetic Programming, 9th European Conference, EuroGP2006*, ed. by P. Collet et al. Lecture Notes in Computer Science, LNCS 3905 (Springer, Budapest, Hungary, 2006), pp. 238–249.Google Scholar - 84.S. Gustafson, L. Vanneschi, Operator-based tree distance in genetic programming. IEEE Trans. Evol. Comput.
**12**, p. 4 (2008)Google Scholar - 85.M. O’Neill, L. Vanneschi, S. Gustafson, W. Banzhaf, Open issues in genetic programming. Genet. Program. Evol. Mach. (2010) (this issue)Google Scholar
- 86.M. Graff, R. Poli, Practical model of genetic programming’s performance on rational symbolic regression problems. in
*Proceedings of the 11th European Conference on Genetic Programming, EuroGP 2008*, ed. by M. O’Neill, L. Vanneschi, S. Gustafson, A.I. Esparcia Alcazar, I. De Falco, A. Della Cioppa, E. Tarantino. Lecture Notes in Computer Science, vol. 4971 (Springer, Naples, 26–28 March 2008), pp. 122–133Google Scholar - 87.M. Graff, R. Poli, Automatic creation of taxonomies of genetic programming systems. in
*Proceedings of the 12th European Conference on Genetic Programming, EuroGP 2009*, ed. by L. Vanneschi, S. Gustafson, A. Moraglio, I. De Falco, M. Ebner. LNCS, vol. 5481 (Springer, Tuebingen, 15–17 April 2009), pp. 145–158Google Scholar - 88.D. Wolpert, W. Macready, No free lunch theorems for optimization. IEEE Trans. Evol. Comput.
**1**, pp. 67–82 (1997)CrossRefGoogle Scholar - 89.D. Whitley, J.P. Watson, Complexity theory and the no free lunch theorem. in
*Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques*, ed. by E.K. Burke, G. Kendall (Springer, US, 2005), Chap. 11, pp. 317–339Google Scholar - 90.C. Schumacher, M.D. Vose, L.D. Whitley, The no free lunch and problem description length. in
*Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001)*, ed. by L. Spector, E.D. Goodman, A. Wu, W.B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M.H. Garzon, E. Burke (Morgan Kaufmann, San Francisco, CA, 7–11 July 2001), pp. 565–570Google Scholar - 91.J.R. Woodward, J.R. Neil, No free lunch, program induction and combinatorial problems. in
*Genetic Programming, Proceedings of EuroGP’2003*, ed. by C. Ryan, T. Soule, M. Keijzer, E. Tsang, R. Poli, E. Costa. LNCS, vol. 2610 (Springer, Essex, 14–16 April 2003), pp. 475–484Google Scholar - 92.W. Banzhaf, A. Leier, Evolution on neutral networks in genetic programming. in
*Genetic Programming Theory and Practice III*, ed. by T. Yu, R. Riolo, B. Worzel (Ann Arbor: Springer, May 2005), vol. 9 of*Genetic Programming*, Chap.14, pp. 207–221Google Scholar - 93.R. Poli, M. Graff, N.F. McPhee, Free lunches for function and program induction. in
*FOGA ’09: Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms*, ed. by I. Garibay, T. Jansen, R.P. Wiegand, A.S. Wu (ACM, Orlando, FL, 9–11 Jan 2009), pp. 183–194Google Scholar - 94.W.A. Greene, A non-linear schema theorem for genetic algorithms. in
*Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000)*, ed. by D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, H.-G. Beyer (Morgan Kaufmann, Las Vegas, NV, 10–12 July 2000), pp. 189–194Google Scholar - 95.J. He, X. Yao, Towards an analytic framework for analysing the computation time of evolutionary algorithms. Artif. Intell.
**145**(1–2), pp. 59–97 (2003)MATHCrossRefMathSciNetGoogle Scholar - 96.W.B. Langdon, R. Poli, Why ants are hard. in
*Genetic Programming 1998: Proceedings of the Third Annual Conference*, ed. by J.R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D.B. Fogel, M.H. Garzon, D.E. Goldberg, H. Iba, R. Riolo (Morgan Kaufmann, University of Wisconsin, Madison, WI, 22–25 July 1998), pp. 193–201Google Scholar - 97.J.E. Rowe, N.F. McPhee, The effects of crossover and mutation operators on variable length linear structures. in
*Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001)*, ed. by L. Spector, E.D. Goodman, A. Wu, W.B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M.H. Garzon, E. Burke (Morgan Kaufmann, San Francisco, CA, 7–11 July 2001), pp. 535–542Google Scholar - 98.N.F. McPhee, R. Poli, J. E. Rowe, A schema theory analysis of mutation size biases in genetic programming with linear representations. in
*Proceedings of the 2001 Congress on Evolutionary Computation CEC 2001*, (Seoul, Korea), May 2001Google Scholar - 99.R. Poli, N.F. McPhee, Exact GP schema theory for headless chicken crossover and subtree mutation. in
*Proceedings of the 2001 Congress on Evolutionary Computation CEC2001*, ed. by (IEEE Press, COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea, 27–30 May 2001), pp. 1062–1069Google Scholar - 100.A. Moraglio, R. Poli, Geometric landscape of homologous crossover for syntactic trees. in
*Proceedings of the 2005 IEEE Congress on Evolutionary Computation (CEC-2005)*, ed. by (IEEE, Edinburgh, 2–4 Sept 2005) vol. 1, pp. 427–434Google Scholar - 101.R. Poli, C.R. Stephens, A.H. Wright, J.E. Rowe, On the search biases of homologous crossover in linear genetic programming and variable-length genetic algorithms. in
*GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference*, ed. by W.B. Langdon, E. Cantú-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M.A. Potter, A.C. Schultz, J.F. Miller, E. Burke, N. Jonoska (Morgan Kaufmann, New York), pp. 868–876Google Scholar - 102.R. Poli, J.E. Rowe, C.R. Stephens, A.H. Wright, Allele diffusion in linear genetic programming and variable-length genetic algorithms with subtree crossover. in
*Genetic Programming, Proceedings of the 5th European Conference, EuroGP 2002*, ed. by J.A. Foster, E. Lutton, J. Miller, C. Ryan, A.G.B. Tettamanzi. LNCS, vol. 2278 (Springer, Kinsale, Ireland, 3–5 April 2002), pp. 212–227Google Scholar - 103.S. Dignum, R. Poli, Sub-tree swapping crossover, allele diffusion and GP convergence. in
*Parallel Problem Solving from Nature - PPSN X*, ed. by G. Rudolph, T. Jansen, S. Lucas, C. Poloni, N. Beume. LNCS, vol. 5199 (Springer, Dortmund, 13–17 Sept 2008), pp. 368–377Google Scholar - 104.W.B. Langdon, W. Banzhaf, Repeated sequences in linear genetic programming genomes. Complex Syst.
**15**(4), pp. 285–306 (2005)MATHMathSciNetGoogle Scholar - 105.W.B. Langdon, W. Banzhaf, Repeated patterns in tree genetic programming. in
*Proceedings of the 8th European Conference on Genetic Programming*, ed. by M. Keijzer, A. Tettamanzi, P. Collet, J.I. van Hemert, M. Tomassini. Lecture Notes in Computer Science, vol. 3447 (Springer, Lausanne, Switzerland, 30 Mar–1 April 2005), pp. 190–202Google Scholar - 106.A. Moraglio, Towards a Geometric Unification of Evolutionary Algorithms. PhD thesis, Computer Science and Electronic Engineering, University of Essex, 2007Google Scholar
- 107.J. Togelius, R. De Nardi, A. Moraglio, Geometric PSO + GP = particle swarm programming. in
*Proceedings of the IEEE World Congress on Computational Intelligence*(IEEE Press, Hong Kong, 1–6 June 2008)Google Scholar - 108.A. Moraglio, S. Silva, Geometric differential evolution on the space of genetic programs. in
*Genetic Programming*, ed. by A.I. Esparcia-Alcázar, A. Ekárt, S. Silva, S. Dignum, A. Şima Uyar. Lecture Notes in Computer Science, vol. 6021 (Springer, 2010), pp. 171–183Google Scholar - 109.N.F. McPhee, R. Poli, Using schema theory to explore interactions of multiple operators. in
*GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference*, ed. by W.B. Langdon, E. Cantú-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M.A. Potter, A.C. Schultz, J.F. Miller, E. Burke, N. Jonoska (New York, Morgan Kaufmann, 2002)Google Scholar - 110.R. Poli, Recursive conditional schema theorem, convergence and population sizing in genetic algorithms. in
*Foundations of Genetic Algorithms Workshop (FOGA 6)*, ed. by W.M. Spears W. Martin (Charlottesville, VA, 2000)Google Scholar - 111.M. Graff, R. Poli, Practical models for the performance of evolutionary program induction algorithms and their extension to other learners and problem solvers. Artif. Intell. (2009) (submitted)Google Scholar
- 112.G. Rudolph, Convergence analysis of canonical genetic algorithm. IEEE Trans. Neural Netw.
**5**(1), pp. 96–101 (1994)CrossRefGoogle Scholar - 113.G. Rudolph, Convergence of evolutionary algorithms in general search spaces. in
*Int. Conf. Evol. Comput*, pp. 50–54 (1996)Google Scholar - 114.L.M. Schmitt, S. Droste, Convergence to global optima for genetic programming systems with dynamically scaled operators. in
*GECCO 2006: Proceedings of the 8th annual conference on Genetic and evolutionary computation*, ed. by M. Keijzer, M. Cattolico, D. Arnold, V. Babovic, C. Blum, P. Bosman, M.V. Butz, C. Coello Coello, D. Dasgupta, S.G. Ficici, J. Foster, A. Hernandez-Aguirre, G. Hornby, H. Lipson, P. McMinn, J. Moore, G. Raidl, F. Rothlauf, C. Ryan, D. Thierens (ACM Press, Seattle, WA, 8–12 July 2006) vol. 1, pp. 879–886Google Scholar - 115.A. Coja-Oghlan, C. Cooper, A.M. Frieze, An efficient sparse regularity concept. in
*SODA*, ed. by C. Mathieu (SIAM) pp. 207–216, 2009Google Scholar - 116.S. Droste, T. Jansen, I. Wegener, A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for separable functions with boolean inputs. Evol. Comput.
**6**(2), pp. 185–196 (1998)CrossRefGoogle Scholar - 117.S. Droste, T. Jansen, I. Wegener, On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci.
**276**(1–2), pp. 51–81 (2002)MATHCrossRefMathSciNetGoogle Scholar - 118.I. Wegener, On the expected runtime and the success probability of evolutionary algorithms. in
*Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000)*, ed. by U. Brandes, D. Wagner. Lecture Notes in Computer Science, vol. 1928 (Springer, Konstanz, Germany, June 15–17, 2000), pp. 1–10Google Scholar - 119.T. Jansen, K.A. De Jong, I. Wegener, On the choice of the offspring population size in evolutionary algorithms. Evol. Comput.
**13**(4), pp. 413–440 (2005)CrossRefGoogle Scholar - 120.C. Witt, Runtime analysis of the (mu + 1) EA on simple pseudo-boolean functions. Evol. Comput.
**14**(1), pp. 65–86 (2006)MathSciNetGoogle Scholar - 121.T. Jansen, I. Wegener, The analysis of evolutionary algorithms—A proof that crossover really can help. Algorithmica
**34**(1), pp. 47–66 (2002)MATHCrossRefMathSciNetGoogle Scholar - 122.T. Storch, I. Wegener, Real royal road functions for constant population size. Theor. Comput. Sci.
**320**(1), pp. 123–134 (2004)MATHCrossRefMathSciNetGoogle Scholar - 123.T. Jansen, I. Wegener, Real royal road functions—where crossover provably is essential. Discrete Appl. Math.
**149**(1–3), pp. 111–125 (2005)MATHCrossRefMathSciNetGoogle Scholar - 124.G.H. Sasaki, B. Hajek, The time complexity of maximum matching by simulated annealing. J. ACM
**35**(2), pp. 387–403 (1988)CrossRefMathSciNetGoogle Scholar - 125.O. Giel, I. Wegener, Evolutionary algorithms and the maximum matching problem. in
*STACS*, pp. 415–426 (2003)Google Scholar - 126.F. Neumann, I. Wegener, Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor. Comput. Sci.
**378**(1), pp. 32–40 (2007)MATHCrossRefMathSciNetGoogle Scholar - 127.J. Scharnow, K. Tinnefeld, I. Wegener, The analysis of evolutionary algorithms on sorting and shortest paths problems. J. Math. Model. Algorithm.
**3**, 349–366 (2004)MATHCrossRefMathSciNetGoogle Scholar - 128.S. Baswana, S. Biswas, B. Doerr, T. Friedrich, P.P. Kurur, F. Neumann,
*Computing Single Source Shortest Paths Using Single-Objective Fitness*(ACM, New York, NY, 2009), pp. 59–66Google Scholar - 129.C. Horoba,
*Analysis of a Simple Evolutionary Algorithm for the Multiobjective Shortest Path Problem*(ACM, New York, NY, 2009), pp. 113–120Google Scholar - 130.T. Storch,
*How Randomized Search Heuristics Find Maximum Cliques in Planar Graphs*(ACM, New York, NY, 2006), pp. 567–574Google Scholar - 131.J. Reichel, M. Skutella,
*Evolutionary Algorithms and Matroid Optimization Problems*(ACM, New York, NY, 2007), pp. 947–954.Google Scholar - 132.D. Ashlock, K. Bryden, S. Corns, On taxonomy of evolutionary computation problems, in
*Proceedings of the 2004 IEEE Congress on Evolutionary Computation*, (IEEE Press, Portland, Oregon, 2004), pp. 1713–1719.Google Scholar - 133.D.A. Ashlock, K.M. Bryden, S. Corns, J. Schonfeld, An updated taxonomy of evolutionary computation problems using graph-based evolutionary algorithms. in
*Proceedings of the 2006 IEEE Congress on Evolutionary Computation*, ed. by G.G. Yen, L. Wang, P. Bonissone, S.M. Lucas (IEEE Press, Vancouver, 2006) pp. 403–410Google Scholar - 134.D. Rochat, M. Tomassini, L. Vanneschi, Dynamic size populations in distributed genetic programming. in
*Proceedings of the 8th European Conference on Genetic Programming*, ed. by M. Keijzer, A. Tettamanzi, P. Collet, J.I. van Hemert, M. Tomassini. Lecture Notes in Computer Science, vol. 3447 (Springer, Lausanne, Switzerland, 30 Mar–1 April 2005), pp. 50–61Google Scholar - 135.M. Tomassini, L. Vanneschi, J. Cuendet, F. Fernandez, A new technique for dynamic size populations in genetic programming. in
*Proceedings of the 2004 IEEE Congress on Evolutionary Computation*, (IEEE Press, Portland, Oregon, 20–23 June 2004), pp. 486–493Google Scholar - 136.D.C. Wedge, D.B. Kell, Rapid prediction of optimum population size in genetic programming using a novel genotype - fitness correlation. in
*GECCO ’08: Proceedings of the 10th annual conference on Genetic and evolutionary computation*, ed. by M. Keijzer, G. Antoniol, C.B. Congdon, K. Deb, B. Doerr, N. Hansen, J.H. Holmes, G.S. Hornby, D. Howard, J. Kennedy, S. Kumar, F.G. Lobo, J.F. Miller, J. Moore, F. Neumann, M. Pelikan, J. Pollack, K. Sastry, K. Stanley, A. Stoica, E.-G. Talbi, I. Wegener (ACM, Atlanta, GA, 2008), pp. 1315–1322Google Scholar - 137.R. Poli, W.B. Langdon, Running genetic programming backward. in
*Genetic Programming Theory and Practice III*. vol. 9 of*Genetic Programming*, ed. by T. Yu, R.L. Riolo, B. Worzel (Springer, Ann Arbor, 12–14 May 2005). Chap. 9, pp. 125–140Google Scholar - 138.R. Poli, W.B. Langdon, Backward-chaining genetic programming. in
*GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation*, ed. by H.-G. Beyer, U.-M. O’Reilly, D.V. Arnold, W. Banzhaf, C. Blum, E.W. Bonabeau, E. Cantu-Paz, D. Dasgupta, K. Deb, J.A. Foster, E.D. de Jong, H. Lipson, X. Llora, S. Mancoridis, M. Pelikan, G.R. Raidl, T. Soule, A.M. Tyrrell, J.-P. Watson, E. Zitzler (ACM Press, Washington DC, 25–29 June 2005) vol. 2, pp. 1777–1778Google Scholar - 139.I. Dempsey, Grammatical Evolution in Dynamic Environments. PhD thesis, University College Dublin, 2007Google Scholar
- 140.N. Wagner, Z. Michalewicz, M. Khouja, R.R. McGregor, Time series forecasting for dynamic environments: The DyFor genetic program model. IEEE Trans. Evol. Comput.
**11**, pp. 433–452 (2007)CrossRefGoogle Scholar - 141.J.V. Hansen, P.B. Lowry, R.D. Meservy, D.M. McDonald, Genetic programming for prevention of cyberterrorism through dynamic and evolving intrusion detection. Decision Support Syst.
**43**, pp. 1362–1374 (2007). Special Issue ClustersGoogle Scholar - 142.D. Jakobović, L. Budin, Dynamic scheduling with genetic programming. in
*Proceedings of the 9th European Conference on Genetic Programming*, ed. by P. Collet, M. Tomassini, M. Ebner, S. Gustafson, A. Ekárt. Lecture Notes in Computer Science, vol. 3905 (Springer, Budapest, Hungary, 10–12 April 2006), pp. 73–84Google Scholar - 143.R.H. Kibria, Y. Li, Optimizing the initialization of dynamic decision heuristics in DPLL SAT solvers using genetic programming. in
*Proceedings of the 9th European Conference on Genetic Programming*, ed. by P. Collet, M. Tomassini, M. Ebner, S. Gustafson, A. Ekárt. Lecture Notes in Computer Science, vol. 3905 (Springer, Budapest, Hungary, 10–12 April 2006), pp. 331–340Google Scholar - 144.W.B. Langdon, R. Poli, Genetic programming bloat with dynamic fitness. in
*Proceedings of the First European Workshop on Genetic Programming*, ed. by W. Banzhaf, R. Poli, M. Schoenauer, T.C. Fogarty. LNCS, vol. 1391 (Springer, Paris, 14–15 April 1998), pp. 96–112Google Scholar - 145.L. Vanneschi, G. Cuccu, A study of genetic programming variable population size for dynamic optimization problems. in
*Proceedings of the 2009 International Conference on Evolutionary Computation (ICEC 2009), part of the International Joint Conference on Computational Intelligence (IJCCI 2009)*, ed. by A. Rosa et al. (2009)Google Scholar - 146.L. Vanneschi, G. Cuccu, Variable size population for dynamic optimization with genetic programming. in
*GECCO ’09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation*, ed. by G. Raidl, F. Rothlauf, G. Squillero, R. Drechsler, T. Stuetzle, M. Birattari, C.B. Congdon, M. Middendorf, C. Blum, C. Cotta, P. Bosman, J. Grahl, J. Knowles, D. Corne, H.-G. Beyer, K. Stanley, J.F. Miller, J. van Hemert, T. Lenaerts, M. Ebner, J. Bacardit, M. O’Neill, M. Di Penta, B. Doerr, T. Jansen, R. Poli, E. Alba (ACM, Montreal, 8–12 July 2009), pp. 1895–1896Google Scholar - 147.T. Hu, W. Banzhaf, The role of population size in rate of evolution in genetic programming. in
*Proceedings of the 12th European Conference on Genetic Programming, EuroGP 2009*, ed. by L. Vanneschi, S. Gustafson, A. Moraglio, I. De Falco, M. Ebner. LNCS, vol. 5481 (Springer, Tuebingen, 15–17 April 2009), pp. 85–96Google Scholar - 148.W. Banzhaf, G. Beslon, S. Christensen, J. Foster, F. Képès, V. Lefort, J. Miller, M. Radman, J. Ramsden, Guidelines: From artificial evolution to computational evolution: A research agenda. Nat. Rev. Genet.
**7**(9), pp. 729–735 (2006)CrossRefGoogle Scholar - 149.N. Kashtan, E. Noor, U. Alon, Varying environments can speed up evolution. Proc. Nat. Acad. Sci.
**104**, pp. 13711–13716 (2007)Google Scholar - 150.F.D. Francone, P. Nordin, W. Banzhaf, Benchmarking the generalization capabilities of a compiling genetic programming system using sparse data sets. in
*Genetic Programming: Proceedings of the first Annual Conference*, ed. by J.R. Koza et al. (MIT Press, Cambridge, 1996), pp. 72–80Google Scholar - 151.W. Banzhaf, F.D. Francone, P. Nordin, The effect of extensive use of the mutation operator on generalization in genetic programming using sparse data sets. in
*4th International Conference on Parallel Problem Solving from Nature (PPSN96)*, ed. by W. Ebeling et al. (Springer, Berlin, 1996), pp. 300–309Google Scholar - 152.I. Kushchu, An evaluation of evolutionary generalization in genetic programming. Artif. Intell. Rev.
**18**(1), pp. 3–14 (2002)MATHCrossRefGoogle Scholar - 153.A.E. Eiben, M. Jelasity, A critical note on experimental research methodology in EC. in
*Congress on Evolutionary Computation (CEC’02)*, (Honolulu, Hawaii, USA), (IEEE Press, Piscataway, NJ, 2002), pp. 582–587Google Scholar - 154.L.E. Da Costa, J.-A. Landry, Relaxed genetic programming. in
*GECCO 2006: Proceedings of the 8th annual conference on Genetic and evolutionary computation*, ed. by M. Keijzer et al. vol. 1, (ACM Press, Seattle, WA, 8–12 July 2006), pp. 937–938Google Scholar - 155.C. Gagné, M. Schoenauer, M. Parizeau, M. Tomassini, Genetic programming, validation sets, and parsimony pressure. in
*Genetic Programming, 9th European Conference, EuroGP2006*, ed. by P. Collet et al. Lecture Notes in Computer Science, LNCS 3905 (Springer, Berlin, Heidelberg, New York, 2006), pp. 109–120Google Scholar - 156.L. Vanneschi, D. Rochat, M. Tomassini, Multi-optimization improves genetic programming generalization ability. in
*GECCO ’07: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation*, ed. by D. Thierens, H.-G. Beyer, J. Bongard, J. Branke, J.A. Clark, D. Cliff, C.B. Congdon, K. Deb, B. Doerr, T. Kovacs, S. Kumar, J.F. Miller, J. Moore, F. Neumann, M. Pelikan, R. Poli, K. Sastry, K.O. Stanley, T. Stutzle, R.A. Watson, I. Wegener (ACM Press, London, 7–11 July 2007), vol. 2, pp. 1759–1759Google Scholar - 157.A.J. Smola, B. Scholkopf, A Tutorial on Support Vector Regression. Tech. Rep. Technical Report Series - NC2-TR-1998-030, NeuroCOLT2, 1999Google Scholar
- 158.J. Rissanen, Modeling by shortest data description. Automatica
**14**, pp. 465–471 (1978)MATHCrossRefGoogle Scholar - 159.M. Giacobini, M. Tomassini, L. Vanneschi, Limiting the number fitness cases in genetic programming using statistics. in
*Parallel Problem Solving from Nature - PPSN VII*, ed. by J.J. Merelo-Guervos, P. Adamidis, H.-G. Beyer, J.-L. Fernandez-Villacanas, H.-P. Schwefel. Lecture Notes in Computer Science, LNCS no. 2439 (Springer, Granada, Spain, 7–11 Sept 2002), pp. 371–380Google Scholar - 160.P.J. Angeline, J.B. Pollack, The evolutionary induction of subroutines. in
*Proceedings of the Fourteenth Annual Conference of the Cognitive Science Society*, (Lawrence Erlbaum, Bloomington, IN, 1992), pp. 236–241Google Scholar - 161.L. Spector, Evolving control structures with automatically defined macros. in
*Working Notes for the AAAI Symposium on Genetic Programming*, ed. by E.V. Siegel, J.R. Koza (AAAI, MIT, Cambridge, MA, 10–12 Nov 1995), pp. 99–105Google Scholar - 162.J.P. Rosca, D.H. Ballard, Discovery of subroutines in genetic programming. in
*Advances in Genetic Programming 2*, ed. by P.J. Angeline, K.E. Kinnear, Jr. (MIT Press, Cambridge, MA, 1996) Chap. 9, pp. 177–202Google Scholar - 163.G. Seront, External concepts reuse in genetic programming. in
*Working Notes for the AAAI Symposium on Genetic Programming*, ed. by E.V. Siegel, J.R. Koza (AAAI, MIT, Cambridge, MA, 10–12 Nov 1995), pp. 94–98Google Scholar - 164.I. Jonyer, A. Himes, Improving modularity in genetic programming using graph-based data mining. in
*Proceedings of the Nineteenth International Florida Artificial Intelligence Research Society Conference*, ed. by G.C.J. Sutcliffe, R.G. Goebel (American Association for Artificial Intelligence, Melbourne Beach, FL, 11–13 May 2006), pp. 556–561Google Scholar - 165.E. Hemberg, C. Gilligan, M. O’Neill, A. Brabazon, A grammatical genetic programming approach to modularity in genetic algorithms. in
*Proceedings of the 10th European Conference on Genetic Programming*, ed. by M. Ebner, M. O’Neill, A. Ekárt, L. Vanneschi, A.I. Esparcia-Alcázar. Lecture Notes in Computer Science, vol. 4445 (Springer, Valencia, Spain, 11–13 April 2007), pp. 1–11Google Scholar - 166.N.F. McPhee, E.F. Crane, S.E. Lahr, R. Poli, Developmental plasticity in linear genetic programming. in
*GECCO ’09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation*, ed. by G. Raidl, F. Rothlauf, G. Squillero, R. Drechsler, T. Stuetzle, M. Birattari, C.B. Congdon, M. Middendorf, C. Blum, C. Cotta, P. Bosman, J. Grahl, J. Knowles, D. Corne, H.-G. Beyer, K. Stanley, J.F. Miller, J. van Hemert, T. Lenaerts, M. Ebner, J. Bacardit, M. O’Neill, M. Di Penta, B. Doerr, T. Jansen, R. Poli, E. Alba (ACM, Montreal, 8–12 July 2009), pp. 1019–1026, Nominated for best paper award in the GP trackGoogle Scholar - 167.N. Kashtan, U. Alon, Spontaneous evolution of modularity and network motifs. Proc. Nat. Acad. Sci. USA
**102**, pp. 13773–13778 (2005)Google Scholar - 168.J.R. Woodward, Modularity in genetic programming. in
*Genetic Programming, Proceedings of EuroGP’2003*, ed. by C. Ryan, T. Soule, M. Keijzer, E. Tsang, R. Poli, E. Costa. LNCS, vol. 2610 (Springer, Essex, 14–16 April 2003), pp. 254–263Google Scholar - 169.J.R. Woodward, Algorithm Induction, Modularity and Complexity. PhD thesis, School of Computer Science, The University of Birmingham, 2005Google Scholar
- 170.J.R. Woodward, Complexity and cartesian genetic programming. in
*Proceedings of the 9th European Conference on Genetic Programming*,ed. by P. Collet, M. Tomassini, M. Ebner, S. Gustafson, A. Ekárt. Lecture Notes in Computer Science, vol. 3905 (Springer, Budapest, Hungary, 10–12 April 2006), pp. 260–269Google Scholar - 171.J.R. Woodward, Invariance of function complexity under primitive recursive functions. in
*Proceedings of the 9th European Conference on Genetic Programming*, ed. by P. Collet, M. Tomassini, M. Ebner, S. Gustafson, A. Ekárt. Lecture Notes in Computer Science, vol. 3905 (Springer, Budapest, Hungary, 10–12 April 2006), pp. 310–319Google Scholar