Smooth Uniform Crossover, Sub-Machine Code GP and
Demes: A Recipe For Solving High-Order Boolean Parity
Problems
R. Poli, J. Page, and W. Langdon. Proceedings of the Genetic and Evolutionary
Computation Conference, 2, page 1162--1169. Orlando, Florida, USA, Morgan Kaufmann, (13-17 July 1999)
Proceedings of the Genetic and Evolutionary
Computation Conference
year
1999
month
13-17 July
pages
1162--1169
publisher
Morgan Kaufmann
volume
2
publisher_address
San Francisco, CA 94104, USA
isbn
1-55860-611-4
notes
GECCO-99, part of banzhaf:1999:gecco99, see
also poli:1999:22parTR A joint meeting of the
eighth international conference on genetic algorithms
(ICGA-99) and the fourth annual genetic programming
conference (GP-99)
Also known as poli:1999:SUCSCGDARFSHBPP
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 poli:1999:22par
%A Poli, Riccardo
%A Page, Jonathan
%A Langdon, W. B.
%B Proceedings of the Genetic and Evolutionary
Computation Conference
%C Orlando, Florida, USA
%D 1999
%E Banzhaf, Wolfgang
%E Daida, Jason
%E Eiben, Agoston E.
%E Garzon, Max H.
%E Honavar, Vasant
%E Jakiela, Mark
%E Smith, Robert E.
%I Morgan Kaufmann
%K algorithms, genetic programming
%P 1162--1169
%T Smooth Uniform Crossover, Sub-Machine Code GP and
Demes: A Recipe For Solving High-Order Boolean Parity
Problems
%U http://www.cs.essex.ac.uk/staff/poli/papers/Poli-GECCO1999.pdf
%V 2
%@ 1-55860-611-4
@inproceedings{poli:1999:22par,
added-at = {2008-06-19T17:46:40.000+0200},
address = {Orlando, Florida, USA},
author = {Poli, Riccardo and Page, Jonathan and Langdon, W. B.},
biburl = {https://www.bibsonomy.org/bibtex/222fc1d103023c971eda808e47a52acbe/brazovayeye},
booktitle = {Proceedings of the Genetic and Evolutionary
Computation Conference},
editor = {Banzhaf, Wolfgang and Daida, Jason and Eiben, Agoston E. and Garzon, Max H. and Honavar, Vasant and Jakiela, Mark and Smith, Robert E.},
interhash = {8f2ba15132552fd6ffc90a918068ffc3},
intrahash = {22fc1d103023c971eda808e47a52acbe},
isbn = {1-55860-611-4},
keywords = {algorithms, genetic programming},
month = {13-17 July},
notes = {GECCO-99, part of \cite{banzhaf:1999:gecco99}, see
also \cite{poli:1999:22parTR} A joint meeting of the
eighth international conference on genetic algorithms
(ICGA-99) and the fourth annual genetic programming
conference (GP-99)
Also known as \cite{poli:1999:SUCSCGDARFSHBPP}},
pages = {1162--1169},
publisher = {Morgan Kaufmann},
publisher_address = {San Francisco, CA 94104, USA},
timestamp = {2008-06-19T17:49:42.000+0200},
title = {Smooth Uniform Crossover, Sub-Machine Code {GP} and
Demes: {A} Recipe For Solving High-Order Boolean Parity
Problems},
url = {http://www.cs.essex.ac.uk/staff/poli/papers/Poli-GECCO1999.pdf},
volume = 2,
year = 1999
}