Grammatical Evolution
Created by W.Langdon from
gp-bibliography.bib Revision:1.8081
- @Article{oneill:2001:TEC,
-
author = "Michael O'Neill and Conor Ryan",
-
title = "Grammatical Evolution",
-
journal = "IEEE Transactions on Evolutionary Computation",
-
year = "2001",
-
volume = "5",
-
number = "4",
-
pages = "349--358",
-
month = aug,
-
keywords = "genetic algorithms, genetic programming, grammatical
evolution, Crossover, Genotype-Phenotype Mapping,
Linear Genome, Grammar, automatic programming,
computational complexity",
-
ISSN = "1089-778X",
-
DOI = "doi:10.1109/4235.942529",
-
size = "10 pages",
-
abstract = "We present grammatical evolution, an evolutionary
algorithm that can evolve complete programs in an
arbitrary language using a variable-length binary
string. The binary genome determines which production
rules in a Backus-Naur form grammar definition are used
in a genotype-to-phenotype mapping process to a
program. We demonstrate how expressions and programs of
arbitrary complexity may be evolved and compare its
performance to genetic programming",
- }
Genetic Programming entries for
Michael O'Neill
Conor Ryan
Citations