BibTeX
@MISC{Langdon_usingdata,
author = {W.B. Langdon},
title = {Using Data Structures within Genetic Programming},
year = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. Category: genetic programming 1 Introduction Human programmers have long recognised that program production, maintenance and testing are eased if the software is written so...
Citations
No citations identified.
