We propose and study new search operators and a novel
node representation that can make GP fitness landscapes
smoother. Together with a tree evaluation method known
as sub-machine-code GP and the use of demes, these make
up a recipe for solving very large parity problems
using GP. We tested this recipe on parity problems with
up to 22 input variables, solving them with a very high
success probability.
%0 Journal Article
%1 poli:2000:22par
%A Poli, Riccardo
%A Page, Jonathan
%D 2000
%J Genetic Programming and Evolvable Machines
%K algorithms, crossover, demes, genetic gp, parity problems programming, representation, sub-machine-code subsymbolic uniform
%N 1/2
%P 37--56
%R doi:10.1023/A:1010068314282
%T Solving High-Order Boolean Parity Problems with Smooth
Uniform Crossover, Sub-Machine Code GP and Demes
%U http://citeseer.ist.psu.edu/335584.html
%V 1
%X We propose and study new search operators and a novel
node representation that can make GP fitness landscapes
smoother. Together with a tree evaluation method known
as sub-machine-code GP and the use of demes, these make
up a recipe for solving very large parity problems
using GP. We tested this recipe on parity problems with
up to 22 input variables, solving them with a very high
success probability.
@article{poli:2000:22par,
abstract = {We propose and study new search operators and a novel
node representation that can make GP fitness landscapes
smoother. Together with a tree evaluation method known
as sub-machine-code GP and the use of demes, these make
up a recipe for solving very large parity problems
using GP. We tested this recipe on parity problems with
up to 22 input variables, solving them with a very high
success probability.},
added-at = {2008-06-19T17:46:40.000+0200},
author = {Poli, Riccardo and Page, Jonathan},
biburl = {https://www.bibsonomy.org/bibtex/2e21ba59e2debceee54b4448f898a6c83/brazovayeye},
doi = {doi:10.1023/A:1010068314282},
interhash = {a4f876473b736bd547b81be6b107f904},
intrahash = {e21ba59e2debceee54b4448f898a6c83},
issn = {1389-2576},
journal = {Genetic Programming and Evolvable Machines},
keywords = {algorithms, crossover, demes, genetic gp, parity problems programming, representation, sub-machine-code subsymbolic uniform},
month = {April},
notes = {Article ID: 253704},
number = {1/2},
pages = {37--56},
timestamp = {2008-06-19T17:49:43.000+0200},
title = {Solving High-Order Boolean Parity Problems with Smooth
Uniform Crossover, Sub-Machine Code {GP} and Demes},
url = {http://citeseer.ist.psu.edu/335584.html},
volume = 1,
year = 2000
}