@brazovayeye

Solving High-Order Boolean Parity Problems with Smooth Uniform Crossover, Sub-Machine Code GP and Demes

, and . Genetic Programming and Evolvable Machines, 1 (1/2): 37--56 (April 2000)
DOI: doi:10.1023/A:1010068314282

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.

Links and resources

Tags

community