Iteration Over Vectors in Genetic Programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.8081
- @TechReport{HPL-2001-327,
-
author = "Evan Kirshenbaum",
-
title = "Iteration Over Vectors in Genetic Programming",
-
institution = "HP Laboratories",
-
year = "2001",
-
type = "Technical Report",
-
number = "HPL-2001-327",
-
month = dec # " 17",
-
keywords = "genetic algorithms, genetic programming",
-
URL = "http://www.hpl.hp.com/techreports/2001/HPL-2001-327.pdf",
-
URL = "http://www.hpl.hp.com/techreports/2001/HPL-2001-327.html",
-
URL = "http://www.kirshenbaum.net/evan/publications/GECCO-2001-tr.pdf",
-
abstract = "genetic programming with bounded iteration constructs,
which allow the computational complexity of the
solution to be an emergent property. It is shown that
such operators render the even-6-parity problem
trivial, and the results of experiments with other,
harder, problems that require O(n) complexity are
shown. This method is contrasted with Automatically
Defined Iterators.",
-
size = "pages",
- }
Genetic Programming entries for
Evan Kirshenbaum
Citations