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. © Springer-Verlag 2004.
CITATION STYLE
Keijzer, M. (2004). Alternatives in Subtree Caching for Genetic Programming. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3003, 328–337. https://doi.org/10.1007/978-3-540-24650-3_31
Mendeley helps you to discover research relevant for your work.