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

Authors:
Riccardo Poli;Jonathan Page
Affiliations:
School of Computer Science, The University of Birmingham, Birmingham, B15 2TT, UK r.poli@cs.bham.ac.uk;School of Computer Science, The University of Birmingham, Birmingham, B15 2TT, UK j.page@cs.bham.ac.uk
Venue:
Genetic Programming and Evolvable Machines
Year:
2000

Citing 13
Cited 23

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Genetic programming II: automatic discovery of reusable programs

Genetic programming II: automatic discovery of reusable programs
A compiling genetic programming system that directly manipulates the machine code

Advances in genetic programming
Hierarchical learning with procedural abstraction mechanisms

Hierarchical learning with procedural abstraction mechanisms
Evolving recursive functions for the even-parity problem using genetic programming

Advances in genetic programming
Parallel genetic programming: a scalable implementation using the transputer network architecture

Advances in genetic programming
Genetic programming: an introduction: on the automatic evolution of computer programs and its applications

Genetic programming: an introduction: on the automatic evolution of computer programs and its applications
The evolution of size and shape

Advances in genetic programming
Sub-machine-code genetic programming

Advances in genetic programming
Uniform Crossover in Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
Evolving Turing-Complete Programs for a Register Machine with Self-modifying Code

Proceedings of the 6th International Conference on Genetic Algorithms
Immediate Transfer of Global Improvements to All Individuals in a Population Compared to Automatically Defined Functions for the EVEN-5, 6-PARITY Problems

EuroGP '98 Proceedings of the First European Workshop on Genetic Programming
Code growth in genetic programming

GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation

Exact Schema Theory for Genetic Programming and Variable-Length Genetic Algorithms with One-Point Crossover

Genetic Programming and Evolvable Machines
The Hierarchical Fair Competition (HFC) Framework for Sustainable Evolutionary Algorithms

Evolutionary Computation
A-Brain: the multiple problems solver

Proceedings of the 2006 ACM symposium on Applied computing
Scalable estimation-of-distribution program evolution

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Genetic programming: profiling reasonable parameter value windows with varying problem difficulty

International Journal of Innovative Computing and Applications
Potential fitness for genetic programming

Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
A-Brain: a general system for solving data analysis problems

Journal of Experimental & Theoretical Artificial Intelligence
Using traceless genetic programming for solving multi-objective optimization problems

Journal of Experimental & Theoretical Artificial Intelligence
Liquid State Genetic Programming

ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
An Adaptive GP Strategy for Evolving Digital Circuits

KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III
An autonomous GP-based system for regression and classification problems

Applied Soft Computing
Approximating geometric crossover in semantic space

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Tree-structure-aware GP operators for automatic gait generation of quadruped robot

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Self modifying cartesian genetic programming: parity

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Evolutionary Design of Graph-Based Structures for Optical Computing

OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
Building on success in genetic programming: adaptive variation and developmental evaluation

ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence
Semantic building blocks in genetic programming

EuroGP'08 Proceedings of the 11th European conference on Genetic programming
Semantics based crossover for boolean problems

Proceedings of the 12th annual conference on Genetic and evolutionary computation
Developments in Cartesian Genetic Programming: self-modifying CGP

Genetic Programming and Evolvable Machines
SMCGP2: self modifying cartesian genetic programming in two dimensions

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Formal verification of candidate solutions for post-synthesis evolutionary optimization in evolvable hardware

Genetic Programming and Evolvable Machines
Evolving reversible circuits for the even-parity problem

EC'05 Proceedings of the 3rd European conference on Applications of Evolutionary Computing
The GISMOE challenge: constructing the pareto program surface using genetic programming to find better programs (keynote paper)

Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering

Quantified Score

Hi-index	0.00

Visualization

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.