- author = "Authur S. Bickel and Riva Wenig Bickel",
- title = "Tree Structured Rules in Genetic Algorithms",
- booktitle = "Genetic Algorithms and their Applications: Proceedings of the second International Conference on Genetic Algorithms",
- year = "1987",
- editor = "John J. Grefenstette",
- pages = "77--81",
- address = "MIT, Cambridge, MA, USA",
- publisher_address = "Hillsdale, NJ, USA",
- month = "28-31 " # jul,
- publisher = "Lawrence Erlbaum Associates",
- keywords = "genetic algorithms, genetic programming",
- size = "5 pages",
-
URL = "
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/icga1987/Bickel_1989_tsrGA.pdf",
-
URL = "http://gpbib.cs.ucl.ac.uk/icga/icga1987.pdf",
-
bibtex_url = "
http://dl.acm.org/citation.cfm?id=42523&CFID=53044018&CFTOKEN=44075976",
-
abstract = "We apply genetic algorithm techniques to the creation
and use of lists of tree- structured production rules
varying in length and complexity. Actions, conditions
and operators are randomly chosen from tables of
possibilities. Use of the techniques of facilitated by
the notions of time delay and dependency in performing
tests or observations and by accounting for
indeterminate test results.
GENES, a general program, can adapt to a variety of systems by changing the contents of the various tables to accomodate the domain of a particular problem and by substituting a library of appropriate cases.",
- notes = "GA applied to variable length lists of tree structured production rules. Mutation applied within trees, eg > replaced by >=. Inversion applied by re-ordering rules, nb does change semantics of rules set because they are applied in order, not applied within trees. Crossover applied to lists NOT to contents of trees",
