Skip to main content
SpringerLink
Log in
Book cover

European Conference on Genetic Programming

EuroGP 2004: Genetic Programming pp 328–337Cite as

Alternatives in Subtree Caching for Genetic Programming

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3003))

Abstract

This work examines 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 vectorized 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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Keith, M.J., Martin, M.C.: Genetic programming in C++: Implementation issues. In: Kinnear Jr., K.E. (ed.) Advances in Genetic Programming, pp. 285–310. MIT Press, Cambridge (1994)

    Google Scholar 

  2. Handley, S.: On the use of a directed acyclic graph to represent a population of computer programs. In: Proceedings of the 1994 IEEE World Congress on Computational Intelligence, Orlando, Florida, USA, pp. 154–159. IEEE Press, Los Alamitos (1994)

    Chapter  Google Scholar 

  3. Singleton, A.: Genetic programming with C++. BYTE, 171–176 (1994)

    Google Scholar 

  4. Keijzer, M.: Efficiently representing populations in genetic programming. In: Angeline, P.J., Kinnear Jr., K.E. (eds.) Advances in Genetic Programming 2, pp. 259–278. MIT Press, Cambridge (1996)

    Google Scholar 

  5. Tackett, W.A.: Recombination, Selection, and the Genetic Construction of Computer Programs. PhD thesis, University of Southern California, Department of Electrical Engineering Systems, USA (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. KiQ Ltd., Amsterdam

    Maarten Keijzer

Authors
  1. Maarten Keijzer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. No Affiliation,  

    Maarten Keijzer

  2. Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, 02139, Cambridge, MA, USA

    Una-May O’Reilly

  3. University of Essex Department of Computing and Electronic Systems, Wivenhoe Park, CO4 3SQ, Colchester, UK

    Simon Lucas

  4. Centre of Informatics and Systems of the University of Coimbra,  

    Ernesto Costa

  5. Department of Computer Science, University of Idaho, ID 83844-1010, Moscow,  

    Terence Soule

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Keijzer, M. (2004). Alternatives in Subtree Caching for Genetic Programming. In: Keijzer, M., O’Reilly, UM., Lucas, S., Costa, E., Soule, T. (eds) Genetic Programming. EuroGP 2004. Lecture Notes in Computer Science, vol 3003. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24650-3_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24650-3_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21346-8

  • Online ISBN: 978-3-540-24650-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation