Size Fair Tree Crossovers
Created by W.Langdon from
gp-bibliography.bib Revision:1.8081
- @InProceedings{langdon:1999:fairx2p,
-
author = "W. B. Langdon",
-
title = "Size Fair Tree Crossovers",
-
booktitle = "Proceedings of the Eleventh Belgium/Netherlands
Conference on Artificial Intelligence (BNAIC'99)",
-
year = "1999",
-
editor = "Eric Postma and Marc Gyssen",
-
pages = "255--256",
-
address = "Kasteel Vaeshartelt, Maastricht, Holland",
-
month = "3-4 " # nov,
-
organisation = "BNVKI, Dutch and the Belgian AI Association",
-
keywords = "genetic algorithms, genetic programming, bloat
reduction, evolution of shape, sub-quadratic length
growth, linear depth growth, uniform initialisation,
binary tree search spaces",
-
URL = "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/fairxo_bnaic99.ps.gz",
-
size = "2 pages",
-
abstract = "Size fair crossover genetic operator for tree based
genetic programming is described and tested. It
produces considerably reduced increases in program size
and no detrimental effect on GP performance. GP search
spaces are partitioned by the ridge in the number of
program v. their size and depth. A ramped uniform
random initialisation is described which straddles the
ridge. With subtree crossover trees increase about one
level per generation leading to sub-quadratic bloat in
length.",
-
notes = "Resumission of
\cite{langdon:1999:fairxo}
https://documentserver.uhasselt.be/handle/1942/4193
July 2024 broken http://www.cs.unimaas.nl/~bnvki/",
- }
Genetic Programming entries for
William B Langdon
Citations