ISAc Lists, A Different Representation for Program Induction

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{ashlock:1998:ISAc,

• author = "Dan Ashlock and Mark Joenks",
• title = "{ISAc} Lists, A Different Representation for Program Induction",
• booktitle = "Genetic Programming 1998: Proceedings of the Third Annual Conference",
• year = "1998",
• editor = "John R. Koza and Wolfgang Banzhaf and Kumar Chellapilla and Kalyanmoy Deb and Marco Dorigo and David B. Fogel and Max H. Garzon and David E. Goldberg and Hitoshi Iba and Rick Riolo",
• pages = "3--10",
• address = "University of Wisconsin, Madison, Wisconsin, USA",
• publisher_address = "San Francisco, CA, USA",
• month = "22-25 " # jul,
• publisher = "Morgan Kaufmann",
• keywords = "genetic algorithms, genetic programming",
• ISBN = "1-55860-548-7",
• URL = "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/gp1998/ashlock_1998_ISAc.pdf",
• size = "9 pages",
• abstract = "The traditional method of using a genetic algorithm to perform program induction is genetic programming which operates upon parse trees. In this papers we introduce a simpler data structure for program induction, the If-Statement-Action ISAc table. We test this data structure on the Tartarus problem of Astro Teller and compare its performance with simple string genes for Tartarus, Teller's own work, and with GP-Automata. In addition to the main result we present a new baseline study for the Tartarus problem. These baseline results suggest state information alone, without reactive ability, can provide relatively high fitness of the Tartarus problem.",
• notes = "Tartarus GP-98",

}

Genetic Programming entries for Daniel Ashlock Mark Joenks

Citations