UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Data Structures and Genetic Programming

Langdon, WB; (1995) Data Structures and Genetic Programming. : Gower Street, London WC1E 6BT, UK.

Full text not available from this repository.

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. 4 page early abstract at http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/GPlist_aigp2.ps

Type: Report
Title: Data Structures and Genetic Programming
Publisher version: http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers...
Additional information: keywords: genetic algorithms, genetic programming, list, evolution, automatic code generation notes: As \citelangdon:1996:aigp2 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 callers data. size: 20 pages
UCL classification: UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
URI: http://discovery.ucl.ac.uk/id/eprint/1327882
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item