- author = "Conor Ryan and Michael O'Neill",
- title = "Grammatical Evolution: A Steady State Approach",
- booktitle = "Second International Workshop on Frontiers in Evolutionary Algorithms",
- year = "1998",
- volume = "2",
- pages = "419--423",
- address = "Research Triangle Park, NC, USA",
- keywords = "genetic algorithms, genetic programming",
-
URL = "
http://ncra.ucd.ie/papers/fea98.ps.gz",
- size = "5 pages",
-
abstract = "We describe a Genetic Algorithm that can evolve
complete programs. Using a variable length linear
genome to govern the mapping of a Backus Naur Form
grammar definition to a program, expressions and
programs of arbitrary complexity may be evolved. Our
system, Grammatical Evolution, has been applied to
problems such as a Symbolic Regression problem, and
finding Trigonometric Identities.
In this paper we describe how we applied GE to Symbolic Integration problem, that being finding a function which is an integral of Cos(X) + 2X + 1. We also show a Steady State selection mechanism was found to improve the performance of Grammatical Evolution.",
- notes = "Symbolic regression",
