The Tree-String Problem: An Artificial Domain for Structure and Content Search

Created by W.Langdon from gp-bibliography.bib Revision:1.3872

@InProceedings{eurogp:GustafsonBK05,
  author =       "Steven Gustafson and Edmund K. Burke and 
                 Natalio Krasnogor",
  editor =       "Maarten Keijzer and Andrea Tettamanzi and 
                 Pierre Collet and Jano I. {van Hemert} and Marco Tomassini",
  title =        "The Tree-String Problem: An Artificial Domain for
                 Structure and Content Search",
  booktitle =    "Proceedings of the 8th European Conference on Genetic
                 Programming",
  publisher =    "Springer",
  series =       "Lecture Notes in Computer Science",
  volume =       "3447",
  year =         "2005",
  address =      "Lausanne, Switzerland",
  month =        "30 " # mar # " - 1 " # apr,
  organisation = "EvoNet",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "3-540-25436-6",
  pages =        "215--226",
  URL =          "http://www.cs.nott.ac.uk/~smg/research/publications/eurogp2005-gustafson-etal.ps",
  URL =          "http://www.cs.nott.ac.uk/~smg/research/publications/eurogp2005-gustafson-etal.pdf",
  DOI =          "doi:10.1007/b107383",
  bibsource =    "DBLP, http://dblp.uni-trier.de",
  abstract =     "This paper introduces the Tree-String problem for
                 genetic programming and related search and optimisation
                 methods. To improve the understanding of optimisation
                 and search methods, we aim to capture the complex
                 dynamic created by the interdependencies of solution
                 structure and content. Thus, we created an artificial
                 domain that is amenable for analysis, yet
                 representative of a wide-range of real-world
                 applications. The Tree-String problem provides several
                 benefits, including: the direct control of both
                 structure and content objectives, the production of a
                 rich and representative search space, the ability to
                 create tunably difficult and random instances and the
                 flexibility for specialisation.",
  notes =        "Part of \cite{keijzer:2005:GP} EuroGP'2005 held in
                 conjunction with EvoCOP2005 and EvoWorkshops2005",
}

Genetic Programming entries for Steven M Gustafson Edmund Burke Natalio Krasnogor

Citations