Execution Trace Caching for Linear Genetic Programming

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

  title =        "Execution Trace Caching for Linear Genetic
  author =       "Carlton Downey and Mengjie Zhang",
  pages =        "1191--1198",
  booktitle =    "Proceedings of the 2011 IEEE Congress on Evolutionary
  year =         "2011",
  editor =       "Alice E. Smith",
  month =        "5-8 " # jun,
  address =      "New Orleans, USA",
  organization = "IEEE Computational Intelligence Society",
  publisher =    "IEEE Press",
  ISBN =         "0-7803-8515-2",
  keywords =     "genetic algorithms, genetic programming",
  DOI =          "doi:10.1109/CEC.2011.5949751",
  abstract =     "In this paper we propose a new caching algorithm for
                 LGP based on exploiting inter-generation program
                 relationships. For each program we cache a partial
                 summary of program execution, and use this summary to
                 expedite the execution of all progeny. We study the
                 theory behind our new caching algorithm and derive
                 equations for optimising algorithm performance. Through
                 both theoretical and empirical results we demonstrate
                 that our caching algorithm can decrease LGP execution
                 time by up to 50percent",
  notes =        "CEC2011 sponsored by the IEEE Computational
                 Intelligence Society, and previously sponsored by the
                 EPS and the IET.",

Genetic Programming entries for Carlton Downey Mengjie Zhang