Created by W.Langdon from gp-bibliography.bib Revision:1.2031
@InProceedings{langdon:2000:random,
author = "W. B. Langdon and W. Banzhaf",
title = "Genetic Programming Bloat without Semantics",
booktitle = "Parallel Problem Solving from Nature - PPSN VI 6th
International Conference",
year = "2000",
editor = "Marc Schoenauer and Kalyanmoy Deb and
G{\"u}nter Rudolph and Xin Yao and Evelyne Lutton and
Juan Julian Merelo and Hans-Paul Schwefel",
volume = "1917",
series = "LNCS",
pages = "201--210",
address = "Paris, France",
month = "16-20 " # sep,
publisher = "Springer Verlag",
keywords = "genetic algorithms, genetic programming, evolution of
shape, subquadratic length growth, linear depth growth,
binary tree search spaces",
URL = "
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_ppsn2000.pdf",
URL = "
http://www.cs.ucl.ac.uk/staff/W.Langdon/wbl_ppsn2000_poster",
URL = "
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_ppsn2000.ps.gz",
URL = "
http://www.cs.mun.ca/~banzhaf/papers/ppsn00.pdf",
doi = "
doi:10.1007/3-540-45356-3_20",
abstract = "To investigate the fundamental causes of bloat, six
artificial random binary tree search spaces are
presented. Fitness is given by program syntax (the
genetic programming genotype). GP populations are
evolved on both random problems and problems with
``building blocks''. These are compared to problems
with explicit ineffective code (introns, junk code,
inviable code). Our results suggest the entropy random
walk explanation of bloat remains viable. The hard
building block problem might be used in further
studies, e.g. of standard subtree crossover.",
notes = "C++ code at ftp://cs.ucl.ac.uk/wblangdon/gp-code/
http://www-syntim.inria.fr/fractales/PPSN2000/program.html#108
PPSN'2000
http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-41056-2",
}
Genetic Programming entries for William B Langdon Wolfgang Banzhaf