- author = "Oliver Brock",
- title = "Evolving Reusable Subroutines for Genetic Programming",
- booktitle = "Artificial Life at Stanford 1994",
- year = "1994",
- editor = "John R. Koza",
- pages = "11--19",
- address = "Stanford, California, 94305-3079 USA",
- month = jun,
- organisation = "Stanford University",
- publisher = "Stanford Bookstore",
- keywords = "genetic algorithms, genetic programming",
- ISBN = "0-18-182105-2",
-
URL = "
http://robotics.stanford.edu/users/oli/PAPERS/a-life.ps",
-
URL = "
http://citeseer.ist.psu.edu/156902.html",
- abstract = "Although automatically defined functions (ADFs) are able to significantly reduce the computational effort required in genetic programming, reasonably di{\AE}cult problems still require large amounts of computation time. However, every time genetic programming evolves a program to solve a problem those ADFs have to be rediscovered from scratch. If the ADFs of a correct program contain partial solutions that are generally useful, they can be used to solve similar problems. This paper proposes a technique to make the information of successful ADFs accessible to genetic programming in order to reduce the computational costs of solving related problems with less computational effort and demonstrates its utility using the example of the even n-parity function.",
-
notes = "This volume contains 22 papers written and submitted
by students describing their term projects for the
course in artificial life (Computer Science 425) at
Stanford University offered during the spring quarter
quarter 1994
http://www-cs-faculty.stanford.edu/~koza/cs425.html
ADFS previously evolved may be used by subsequent GP runs. Ie become part of fitness set for rpb and adf of later runs.",
