Evolution of iterative formulas using Cartesian genetic programming

Authors:
Milos Minarik;Lukas Sekanina
Affiliations:
Brno University of Technology, Faculty of Information Technology, Brno, Czech Republic;Brno University of Technology, Faculty of Information Technology, Brno, Czech Republic
Venue:
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part I
Year:
2011

Citing 11
Cited 0

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
Principles in the Evolutionary Design of Digital Circuits—Part I

Genetic Programming and Evolvable Machines
Cartesian Genetic Programming

Proceedings of the European Conference on Genetic Programming
Evolutionary Design of Arbitrarily Large Sorting Networks Using Development

Genetic Programming and Evolvable Machines
Advanced techniques for the creation and propagation of modules in cartesian genetic programming

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Self modifying cartesian genetic programming: parity

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Human-competitive results produced by genetic programming

Genetic Programming and Evolvable Machines
Developments in Cartesian Genetic Programming: self-modifying CGP

Genetic Programming and Evolvable Machines
The Automatic Acquisition, Evolution and Reuse of Modules in Cartesian Genetic Programming

IEEE Transactions on Evolutionary Computation
Coevolution of Fitness Predictors

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many functions such as division or square root are implemented in hardware using iterative algorithms. We propose a genetic programming-based method to automatically design simple iterative algorithms from elementary functions. In particular, we demonstrated that Cartesian Genetic Programming can evolve various iterative formulas for tasks such as division or determining the greatest common divisor using a reasonable computational effort.