Schema Theory without Expectations for GP and GAs with One-Point Crossover in the Presence of Schema Creation
Created by W.Langdon from
gp-bibliography.bib Revision:1.8098
- @TechReport{poli:CSRP-99-13,
-
author = "Riccardo Poli",
-
title = "Schema Theory without Expectations for {GP} and {GA}s
with One-Point Crossover in the Presence of Schema
Creation",
-
institution = "University of Birmingham, School of Computer Science",
-
number = "CSRP-99-13",
-
month = may,
-
year = "1999",
-
file = "/1999/CSRP-99-13.ps.gz",
-
URL = "ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1999/CSRP-99-13.ps.gz",
-
reportfilename = "pub/tech-reports/1999/CSRP-99-13.ps.gz",
-
keywords = "genetic algorithms, genetic programming",
-
abstract = "We present new theoretical results on GA and GP
schemata which allow one to predict with a known
probability whether the number of instances of a given
schema at the next generation is going to be above a
given threshold. Unlike previous results, this schema
theory does not use expected values and accounts for
schema creation.",
- }
Genetic Programming entries for
Riccardo Poli
Citations