Sampling of Unique Structures and Behaviours in Genetic Programming

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

Volumn 3003, Issue , 2004, Pages 279-288

  Gustafson, Steven ^a   Burke, Edmund K ^a   Kendall, Graham ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIORAL RESEARCH; GENETIC ALGORITHMS; TREES (MATHEMATICS);

EVOLUTIONARY PROCESS; TREE STRUCTURES;

GENETIC PROGRAMMING;

EID: 35048899818     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24650-3_26     Document Type: Article

References (28)

1. J.M. Daida, R.R. Bertram, S.A. Stanhope, J.C. Khoo, S.A. Chaudhary, O.A. Chaudhri, and J.A. Polito II. What makes a problem GP-hard? analysis of a tunably difficult problem in genetic programming. Genetic Programming and Evolvable Machines, 2(2):165-191, June 2001.
2. U.-M. O'Reilly. The impact of external dependency in genetic programming primitives. In Proceedings of the 1998 IEEE World Congress on Computational Intelligence, pages 306-311, Anchorage, Alaska, USA, 5-9 May 1998. IEEE Press.
3. J. Hu, K. Seo, S. Li, Z. Fan, R.C. Rosenberg, and E.D. Goodman. Structure fitness sharing (SFS) for evolutionary design by genetic programming. In W.B. Langdon et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 780-787, New York, 9-13 July 2002. Morgan Kaufmann Publishers.
4. E. Burke, S. Gustafson, and G. Kendall. A survey and analysis of diversity measures in genetic programming. In W. B. Langdon et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 716-723, New York, 9-13 July 2002. Morgan Kaufmann Publishers.
5. E. Burke, S. Gustafson, G. Kendall, and N. Krasnogor. Advanced population diversity measures in genetic programming. In J.J. Merelo Guervós et al., editors, Parallel Problem Solving from Nature, volume 2439 of LNCS, pages 341-350, Granada, Spain, September 2002. Springer.
6. E.K. Burke, S. Gustafson, G. Kendall, and N. Krasnogor. Is increasing diversity in genetic programming beneficial? an analysis of the effects on fitness. In B. McKay et al., editors, Congress on Evolutionary Computation, pages 1398-1405, Canberra, Australia, December 2003. IEEE Press.
7. T. Soule and J.A. Foster. Code size and depth flows in genetic programming. In J.R. Koza et al., editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 313-320, Stanford University, CA, USA, 13-16 July 1997. Morgan Kaufmann.
8. W.B. Langdon, T. Soule, R. Poli, and J.A. Foster. The evolution of size and shape. In Lee Spector et al., editors, Advances in Genetic Programming 3, chapter 8, pages 163-190. MIT Press, Cambridge, MA, USA, June 1999.
9. W.B. Langdon. The evolution of size in variable length representations. In 1998 IEEE International Conference on Evolutionary Computation, pages 633-638, Anchorage, Alaska, USA, 5-9 May 1998. IEEE Press.
10. W. Banzhaf and W. B. Langdon. Some considerations on the reason for bloat. Genetic Programming and Evolvable Machines, 3(1):81-91, March 2002.
11. W.B. Langdon. Quadratic bloat in genetic programming. In D. Whitley et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 451-458, Las Vegas, Nevada, USA, 10-12 July 2000. Morgan Kaufmann.
12. T. Soule and R.B. Heckendorn. An analysis of the causes of code growth in genetic programming. Genetic Programming and Evolvable Machines, 3(3):283-309, Sept. 2002.
13. S. Luke. Modification point depth and genome growth in genetic programming. Evolutionary Computation, 11(1):67-106, 2003.
14. W.B. Langdon. Scaling of program fitness spaces. Evolutionary Computation, 7(4):399-428, 1999.
15. J.M. Daida. Limits to expression in genetic programming: Lattice-aggregate modeling. In D.B. Fogel et al., editors, Congress on Evolutionary Computation, pages 273-278, Honolulu, USA, 2002. IEEE Press.
16. J.M. Daida, H. Li, R. Tang, and A.M. Hilss. What makes a problem GP-hard? validating a hypothesis of structural causes. In E. Cantú-Paz et al., editors, Proceedings of the Genetic and Evolutionary Computation, volume 2724 of LNCS, pages 1665-1677, Chicago, 12-16 July 2003. Springer-Verlag.
17. J. Rosca and D.H. Ballard. Causality in genetic programming. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 256-263, Pittsburgh, PA, USA, 15-19 1995. Morgan Kaufmann.
18. C. Igel and K. Chellapilla. Investigating the influence of depth and degree of genotypic change on fitness in genetic programming. In W. Banzhaf et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 1061-1068, Orlando, Florida, USA, 13-17 July 1999. Morgan Kaufmann.
19. R. Poli and W.B. Langdon. On the search properties of different crossover operators in genetic programming. In J.R. Koza et al., editors, Proceedings of the Third Annual Genetic Programming Conference, pages 293-301, Wisconsin, USA, 22-25 July 1998. Morgan Kaufmann.
20. P. D'haeseleer and J. Bluming. Effects of locality in individual and population evolution. In K.E. Kinnear, Jr., editor, Advances in Genetic Programming, chapter 8, pages 177-198. MIT Press, 1994.
21. N.F. McPhee and N.J. Hopper. Analysis of genetic diversity through population history. In W. Banzhaf et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 1112-1120, Florida, USA, 1999. Morgan Kaufmann.
22. W.B. Langdon and R. Poli. Foundations of Genetic Programming. Springer-Verlag, 2002.
23. U.-M. O'Reilly and F. Oppacher. Program search with a hierarchical variable length representation: Genetic programming, simulated annealing and hill climbing. In Y. Davidor et al., editors, Parallel Problem Solving from Nature, number 866 in LNCS, pages 397-406, Jerusalem, 9-14 October 1994. Springer-Verlag.
24. U.-M. O'Reilly and F. Oppacher. A comparative analysis of GP. In P.J. Angeline and K. E. Kinnear, Jr., editors, Advances in Genetic Programming 2, chapter 2, pages 23-44. MIT Press, Cambridge, MA, USA, 1996.
25. A. Juels and M. Wattenberg. Stochastic hillclimbing as a baseline method for evaluating genetic algorithms. Technical Report Technical Report CSD-94-834. Computers Science Department, University of California at Berkeley, USA, 1995.
26. N.L. Cramer. A representation for the adaptive generation of simple sequential programs. In J.J. Grefenstette, editor, Proceedings of an International Conference on Genetic Algorithms and the Applications, pages 183-187, Carnegie-Mellon University, Pittsburgh, PA, USA, 24-26 July 1985.
27. J.R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.
28. U.-M. O'Reilly and D.E. Goldberg. How fitness structure affects subsolution acquisition in genetic programming. In J.R. Koza et al., editors, Proceedings of the Third Annual Genetic Programming Conference, pages 269-277, Madison, WI, USA, 22-25 July 1998. Morgan Kaufmann.