Created by W.Langdon from gp-bibliography.bib Revision:1.2031
@InProceedings{page:1999:smuxspmGP,
author = "J. Page and R. Poli and W. B. Langdon",
title = "Smooth Uniform Crossover with Smooth Point Mutation in
Genetic Programming: {A} Preliminary Study",
booktitle = "Genetic Programming, Proceedings of EuroGP'99",
year = "1999",
editor = "Riccardo Poli and Peter Nordin and
William B. Langdon and Terence C. Fogarty",
volume = "1598",
series = "LNCS",
pages = "39--49",
address = "Goteborg, Sweden",
publisher_address = "Berlin",
month = "26-27 " # may,
organisation = "EvoNet",
publisher = "Springer-Verlag",
keywords = "genetic algorithms, genetic programming",
ISBN = "3-540-65899-8",
URL = "
http://www.cs.essex.ac.uk/staff/poli/papers/Page-EUROGP1999.pdf",
URL = "
http://citeseer.ist.psu.edu/336173.html",
URL = "
http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=1598&spage=39",
abstract = "In this paper we examine the behaviour of the uniform
crossover and point mutation GP operators [12] on the
even-n-parity problem for n = 3; 4; 6 and present a
novel representation of function nodes, designed to
allow the search operators to make smaller movements
around the solution space. Using this representation,
performance on the even-6-parity problem is improved by
three orders of magnitude relative to the estimate
given for standard GP in [5].",
notes = "EuroGP'99, part of \cite{poli:1999:GP}
Evolve function node within trees as well as trees.
Demonstrated on big parity problems.",
}
Genetic Programming entries for Jonathan Page Riccardo Poli William B Langdon