W. Langdon. Research Note, RN/96/1. UCL, Gower Street, London, WC1E 6BT, UK, (January 1996)
Abstract
In earlier work we showed that GP can automatically
generate simple data types (stacks, queues and lists).
The results presented herein show, in some cases,
provision of appropriately structured memory can indeed
be advantageous to GP in comparison with directly
addressable indexed memory.
Three ``classic'' problems are solved. The first two
require the GP to distinguish between sentences that
are in a language and those that are not given positive
and negative training examples of the language. The two
languages are, correctly nested brackets and a Dyck
language (correctly nested brackets of different
types). The third problem is to evaluate integer
Reverse Polish (postfix) expressions.
Comparisons are made between GP attempting to solve
these problems when provided with indexed memory or
with stack data structures.
%0 Report
%1 Langdon:1996:usedataRN
%A Langdon, W. B.
%C Gower Street, London, WC1E 6BT, UK
%D 1996
%K (ADF), Artificial Automatic Automatically Data Defined Demes Evolution, Expressions, Functions Learning, Machine Object Oriented Pareto Polish Programming, Push Reverse Stack, Structures, algorithms, automatic code context down fitness, free generation, genetic induction, language programming,
%N RN/96/1
%T Using Data Structures within Genetic Programming
%U http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/WBL.gp96.ps
%X In earlier work we showed that GP can automatically
generate simple data types (stacks, queues and lists).
The results presented herein show, in some cases,
provision of appropriately structured memory can indeed
be advantageous to GP in comparison with directly
addressable indexed memory.
Three ``classic'' problems are solved. The first two
require the GP to distinguish between sentences that
are in a language and those that are not given positive
and negative training examples of the language. The two
languages are, correctly nested brackets and a Dyck
language (correctly nested brackets of different
types). The third problem is to evaluate integer
Reverse Polish (postfix) expressions.
Comparisons are made between GP attempting to solve
these problems when provided with indexed memory or
with stack data structures.
@techreport{Langdon:1996:usedataRN,
abstract = {In earlier work we showed that GP can automatically
generate simple data types (stacks, queues and lists).
The results presented herein show, in some cases,
provision of appropriately structured memory can indeed
be advantageous to GP in comparison with directly
addressable indexed memory.
Three ``classic'' problems are solved. The first two
require the GP to distinguish between sentences that
are in a language and those that are not given positive
and negative training examples of the language. The two
languages are, correctly nested brackets and a Dyck
language (correctly nested brackets of different
types). The third problem is to evaluate integer
Reverse Polish (postfix) expressions.
Comparisons are made between GP attempting to solve
these problems when provided with indexed memory or
with stack data structures.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {Gower Street, London, WC1E 6BT, UK},
author = {Langdon, W. B.},
biburl = {https://www.bibsonomy.org/bibtex/2875532499f61f08ebfd594c46d591f8a/brazovayeye},
institution = {UCL},
interhash = {ef5b904f09b1956232b501d21898fb46},
intrahash = {875532499f61f08ebfd594c46d591f8a},
keywords = {(ADF), Artificial Automatic Automatically Data Defined Demes Evolution, Expressions, Functions Learning, Machine Object Oriented Pareto Polish Programming, Push Reverse Stack, Structures, algorithms, automatic code context down fitness, free generation, genetic induction, language programming,},
month = {January},
notes = {Accepted for presentation at GP96. Updated version in
proceedings and url, see \cite{Langdon:1996:usedata}},
number = {RN/96/1},
size = {10 pages},
timestamp = {2008-06-19T17:44:44.000+0200},
title = {Using Data Structures within Genetic Programming},
type = {Research Note},
url = {http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/WBL.gp96.ps},
year = 1996
}