Alternatives in Subtree Caching for Genetic Programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3003, Issue , 2004, Pages 328-337

  Keijzer, Maarten ^a  

^a KiQ Ltd   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS;

ADD-ON MODULE; CACHING MECHANISM; FIXED SIZE; GENETIC PROGRAMMING SYSTEM; RUN-TIME EFFICIENCY; SUB TREES;

GENETIC PROGRAMMING;

EID: 35048863512     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24650-3_31     Document Type: Article

References (5)

1. Keith, M.J., Martin, M.C.: Genetic programming in C++: Implementation issues. In Kinnear, Jr., K.E., ed.: Advances in Genetic Programming. MIT Press (1994) 285-310
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, IEEE Press (1994) 154-159
3. Singleton, A.: Genetic programming with C++. BYTE (1994) 171-176
4. Keijzer, M.: Efficiently representing populations in genetic programming. In Arigeline, P.J., Kinnear, Jr., K.E., eds.: Advances in Genetic Programming 2. MIT Press, Cambridge, MA, USA (1996) 259-278
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)