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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Minarik, M., & Sekanina, L. (2011). Evolution of iterative formulas using cartesian genetic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6881 LNAI, pp. 11–20). https://doi.org/10.1007/978-3-642-23851-2_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
