The Tree-String problem: An artificial domain for structure and content search

Lecture Notes in Computer Science

Volumn 3447, Issue , 2005, Pages 215-226

  Gustafson, Steven ^a   Burke, Edmund K ^a   Krasnogor, Natalio ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; OPTIMIZATION; TREES (MATHEMATICS);

GENETIC PROGRAMMING; SEARCH SPACE; TREE-STING PROBLEM;

PROBLEM SOLVING;

EID: 24644447491     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31989-4_19     Document Type: Conference Paper

References (18)

1. D.S. Johnson, C.H. Papadimitriou, and M. Yannakakis. How easy is local search? Journal of Computer and System Sciences, 37(1), August 1988.
2. D. Fox, W. Burgard, H. Kruppa, and S. Thrun. A probabilistic approach to collaborative multi-robot localization. Autonomous Robots, 8(3):325-344, 2000.
3. J.R. Quinlan. Induction of decision trees. Machine Learning, 1:81-106, 1986.
4. J.R. Koza et al. Genetic Programming IV: Routine Human-Competitive Machine Intelligence. Kluwer Academic Publishers, 2003.
5. I. Kushchu. An evaluation of evolutionary generalisation in genetic programming. Artificial Intelligence Review, 18(1):3-14, 2002.
6. J.M. Daida et al. 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.
7. S. Gustafson, A. Ekárt, E.K. Burke, and G. Kendall. Problem difficulty and code growth in genetic programming. Genetic Programming and Evolvable Hardware, 5(3):271-290, 2004.
8. 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, IL, USA, 12-16 July 2003. Springer-Verlag.
9. C. Gathercole and P. Ross. An adverse interaction between crossover and restricted tree depth in genetic programming. In J.R. Koza et al., editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 291-296, Stanford University, CA, USA, 28-31 July 1996. MIT Press.
10. W.B. Langdon and R. Poli. Foundations of Genetic Programming. Springer-Verlag, Berlin, 2002.
11. W.F. Punch, D. Zongker, and E.D. Goodman. The royal tree problem, a benchmark for single and multi-population genetic programming. In P.J. Angeline and K.E. Kinnear, Jr., editors, Advances in Genetic Programming 2, chapter 15, pages 299-316. The MIT Press, Cambridge, MA, USA, 1996.
12. U.-M. O'Reilly. The impact of external dependency in genetic programming primitives. In Proceedings of the IEEE World Congress on Computational Intelligence, pages 306-311, Anchorage, AL, USA, 5-9 May 1998. IEEE Press.
13. 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.
14. D.E. Goldberg and U.-M. O'Reilly. Where does the good stuff go, and why? how contextual semantics influence program structure in simple genetic programming. In W. Banzhaf et al., editors, Genetic Programming, Proceedings of the First European Workshop, volume 1391 of LNCS, pages 16-36, Paris, 1998. Springer-Verlag.
15. S. Gustafson. An Analysis of Diversity in Genetic Programming. PhD thesis, School of Computer Science and Information Technology, University of Nottingham, Nottingham, England, February 2004.
16. 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.
17. E.D. de Jong and J.B. Pollack. Multi-objective methods for tree size control. Genetic Programming and Evolvable Machines, 4(3):211-233, September 2003.
18. A. Ekárt and S. Gustafson. A data structure for improved GP analysis via efficient computation and visualisation of population measures. In M. Keijzer et al., editors, Genetic Programming, Proceedings of the 6th European Conference, volume 3003 of LNCS, pages 35-46, Coimbra, Portugal, April 2004. Springer-Verlag.