Alternatives in Subtree Caching for Genetic Programming

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

  author =       "Maarten Keijzer",
  title =        "Alternatives in Subtree Caching for Genetic
  booktitle =    "Genetic Programming 7th European Conference, EuroGP
                 2004, Proceedings",
  year =         "2004",
  editor =       "Maarten Keijzer and Una-May O'Reilly and 
                 Simon M. Lucas and Ernesto Costa and Terence Soule",
  volume =       "3003",
  series =       "LNCS",
  pages =        "328--337",
  address =      "Coimbra, Portugal",
  publisher_address = "Berlin",
  month =        "5-7 " # apr,
  organisation = "EvoNet",
  publisher =    "Springer-Verlag",
  keywords =     "genetic algorithms, genetic programming: Poster",
  ISBN =         "3-540-21346-5",
  URL =          "",
  DOI =          "doi:10.1007/978-3-540-24650-3_31",
  abstract =     "We examine a number of subtree caching mechanisms that
                 are capable of adapting during the course of a run
                 while maintaining a fixed size cache of already
                 evaluated subtrees. A cache update and flush mechanism
                 is introduced as well as the benefits of vectorised
                 evaluation over the standard case-by-case evaluation
                 method for interpreted genetic programming systems are
                 discussed. The results show large benefits for the use
                 of even very small subtree caches. One of the
                 approaches studied here can be used as a simple add-on
                 module to an existing genetic programming system,
                 providing an opportunity to improve the runtime
                 efficiency of such a system.",
  notes =        "Part of \cite{keijzer:2004:GP} EuroGP'2004 held in
                 conjunction with EvoCOP2004 and EvoWorkshops2004",

Genetic Programming entries for Maarten Keijzer