Relative Referenced Genetic Programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.8187
- @Article{Palmer:2008:CS,
-
author = "John M. Palmer",
-
title = "Relative Referenced Genetic Programming",
-
journal = "Complex Systems",
-
year = "2008",
-
volume = "17",
-
number = "4",
-
pages = "339--356",
-
keywords = "genetic algorithms, genetic programming",
-
ISSN = "0891-2513",
-
URL = "http://www.complex-systems.com/pdf/17-4-2.pdf",
-
URL = "http://www.complex-systems.com/abstracts/v17_i04_a02.html",
-
size = "18 pages",
-
abstract = "This paper presents a linear code referencing approach
to the representation of individuals within a genetic
programming scheme. This approach has been devised in
order to confront various problems associated with
genetic programming schemes. These are primarily the
size of the available search space, the ability to pass
through this search space, the construction of valid
individuals after crossover and mutation, and the
probability for the use of terminals and subpieces of
an individual's solution. A comparison is made with
existing methods and for the problems tested the
presented method gives the best results.",
-
notes = "http://www.complex-systems.com/",
- }
Genetic Programming entries for
John M Palmer
Citations