An effective parse tree representation for tartarus

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

@InProceedings{Dick:2013:GECCOa,
  author =       "Grant Dick",
  title =        "An effective parse tree representation for tartarus",
  booktitle =    "GECCO '13: Proceeding of the fifteenth annual
                 conference on Genetic and evolutionary computation
                 conference",
  year =         "2013",
  editor =       "Christian Blum and Enrique Alba and Anne Auger and 
                 Jaume Bacardit and Josh Bongard and Juergen Branke and 
                 Nicolas Bredeche and Dimo Brockhoff and 
                 Francisco Chicano and Alan Dorin and Rene Doursat and 
                 Aniko Ekart and Tobias Friedrich and Mario Giacobini and 
                 Mark Harman and Hitoshi Iba and Christian Igel and 
                 Thomas Jansen and Tim Kovacs and Taras Kowaliw and 
                 Manuel Lopez-Ibanez and Jose A. Lozano and Gabriel Luque and 
                 John McCall and Alberto Moraglio and 
                 Alison Motsinger-Reif and Frank Neumann and Gabriela Ochoa and 
                 Gustavo Olague and Yew-Soon Ong and 
                 Michael E. Palmer and Gisele Lobo Pappa and 
                 Konstantinos E. Parsopoulos and Thomas Schmickl and Stephen L. Smith and 
                 Christine Solnon and Thomas Stuetzle and El-Ghazali Talbi and 
                 Daniel Tauritz and Leonardo Vanneschi",
  isbn13 =       "978-1-4503-1963-8",
  pages =        "909--916",
  keywords =     "genetic algorithms, genetic programming",
  month =        "6-10 " # jul,
  organisation = "SIGEVO",
  address =      "Amsterdam, The Netherlands",
  DOI =          "doi:10.1145/2463372.2463497",
  publisher =    "ACM",
  publisher_address = "New York, NY, USA",
  abstract =     "Recent work in genetic programming (GP) has
                 highlighted the need for stronger benchmark problems.
                 For benchmarking planning scenarios, the artificial ant
                 problem is often used. With a limited number of test
                 cases, this problem is often fairly simple to solve. A
                 more complex planning problem is Tartarus, but as of
                 yet no standard representation for Tartarus exists for
                 GP. This paper examines an existing parse tree
                 representation for Tartarus, and identifies weaknesses
                 in the way in which it manipulates environmental
                 information. Through this analysis, an alternative
                 representation is proposed for Tartarus that shares
                 many similarities with those already used in GP for
                 planning problems. Empirical analysis suggests that the
                 proposed representation has qualities that make it a
                 suitable benchmark problem.",
  notes =        "Also known as \cite{2463497} GECCO-2013 A joint
                 meeting of the twenty second international conference
                 on genetic algorithms (ICGA-2013) and the eighteenth
                 annual genetic programming conference (GP-2013)",
}

Genetic Programming entries for Grant Dick

Citations