Divide and conquer: genetic programming based on multiple branches encoding

Authors:
Katya Rodríguez-Vázquez;Carlos Oliver-Morales
Affiliations:
DISCA, IIMAS, National Autonomous University of Mexico, Mexico City, Mexico;DISCA, IIMAS, National Autonomous University of Mexico, Mexico City, Mexico
Venue:
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Year:
2003

Citing 11
Cited 1

Structure identification of nonlinear dynamic systems—a survey on input/output approaches

Automatica (Journal of IFAC)
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
Genetic programming using a minimum description length principle

Advances in genetic programming
Explicitly defined introns and destructive crossover in genetic programming

Advances in genetic programming
Adaptive fitness functions for dynamic growing/pruning of program trees

Advances in genetic programming
Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming!

Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming!
Accelerated Genetic Programming of Polynomials

Genetic Programming and Evolvable Machines
A Two Level Evolutionary Modeling System For Financial Data

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
MB GP In Modelling And Prediction

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Foundations of Genetic Programming

Foundations of Genetic Programming

Genetic Programming for Mining DNA Chip Data from Cancer Patients

Genetic Programming and Evolvable Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an alternative genetic programming encoding, which is based on a rooted-node with fixed-content. This rooted node combines partial results of a set of multiple branches. Hence, this approach is named Multiple Branches Genetic Programming. It is tested on a symbolic regression problem and used on a Boolean domain to solve the even-n parity problem.