Created by W.Langdon from gp-bibliography.bib Revision:1.2031
@InCollection{langdon:1996:aigp2,
author = "William B. Langdon",
title = "Data Structures and Genetic Programming",
booktitle = "Advances in Genetic Programming 2",
publisher = "MIT Press",
year = "1996",
editor = "Peter J. Angeline and K. E. {Kinnear, Jr.}",
pages = "395--414",
chapter = "20",
address = "Cambridge, MA, USA",
keywords = "genetic algorithms, genetic programming, list,
evolution, automatic code generation",
ISBN = "0-262-01158-1",
URL = "
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/WBL.aigp2.ch20.ps",
URL = "
http://cisnet.mit.edu/Advances-in-Genetic-Programming/412",
abstract = "In real world applications, software engineers
recognise the use of memory must be organised via data
structures and that software using the data must be
independant of the data structures' implementation
details. They achieve this by using abstract data
structures, such as records, files and buffers.
We demonstrate that genetic programming can
automatically implement simple abstract data
structures, considering in detail the task of evolving
a list. We show general and reasonably efficient
implementations can be automatically generated from
simple primitives.
A model for maintaining evolved code is demonstrated
using the list problem.",
notes = "Syntax rules restrict for while loops so they are not
nested. Run time data used to guide location of
crossover points CPU and memory usage included in
fitness via Pareto tournament selection. Pass by
reference and call by reference used inconjunction with
ADFs. Scoping rules allow ADFs access to caller's
argument directly.",
size = "20 pages",
}
Genetic Programming entries for William B Langdon