Skip to main content
SpringerLink
Log in

Evolution of Iterative Formulas Using Cartesian Genetic Programming

  • Conference paper
Knowledge-Based and Intelligent Information and Engineering Systems (KES 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6881))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  2. Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge (1994)

    MATH  Google Scholar 

  3. Koza, J.R.: Human-competitive results produced by genetic programming. Genetic Programming and Evolvable Machines 11, 251–284 (2010)

    Article  Google Scholar 

  4. Schmidt, M.D., Lipson, H.: Coevolution of Fitness Predictors. IEEE Transactions on Evolutionary Computation 12, 736–749 (2008)

    Article  Google Scholar 

  5. Harding, S., Miller, J.F., Banzhaf, W.: Developments in cartesian genetic programming: self-modifying cgp. Genetic Programming and Evolvable Machines 11, 397–439 (2010)

    Article  Google Scholar 

  6. Sekanina, L., Bidlo, M.: Evolutionary design of arbitrarily large sorting networks using development. Genetic Programming and Evolvable Machines 6, 319–347 (2005)

    Article  Google Scholar 

  7. Miller, J.F., Thomson, P.: Cartesian Genetic Programming. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.) EuroGP 2000. LNCS, vol. 1802, pp. 121–132. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. Harding, S., Miller, J.F., Banzhaf, W.: Self modifying cartesian genetic programming: Parity. In: 2009 IEEE Congress on Evolutionary Computation, pp. 285–292. IEEE Press, Los Alamitos (2009)

    Chapter  Google Scholar 

  9. Miller, J.F., Job, D., Vassilev, V.K.: Principles in the Evolutionary Design of Digital Circuits – Part I. Genetic Programming and Evolvable Machines 1, 8–35 (2000)

    MATH  Google Scholar 

  10. Walker, J.A., Miller, J.F.: The Automatic Acquisition, Evolution and Re-use of Modules in Cartesian Genetic Programming. IEEE Transactions on Evolutionary Computation 12, 397–417 (2008)

    Article  Google Scholar 

  11. Kaufmann, P., Platzner, M.: Advanced techniques for the creation and propagation of modules in cartesian genetic programming. In: Proc. of Genetic and Evolutionary Computation Conference, GECCO 2008, pp. 1219–1226. ACM, New York (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Information Technology, Brno University of Technology, Božetěchova 2, 612 66, Brno, Czech Republic

    Milos Minarik & Lukas Sekanina

Authors
  1. Milos Minarik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lukas Sekanina
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Integrated Sensor Systems, University of Kaiserslautern, Erwin-Schroedinger-str. 12, 67663, Kaiserslautern, Germany

    Andreas König

  2. Knowledge-Based Systems Group, Department of omputer Science, University of Kaiserslautern, P.O. Box 3049, 67653, Kaiserslautern, Germany

    Andreas Dengel

  3. School of Business, University of Applied Sciences Northwestern Switzerland, Riggenbachstr. 16, 4600, Olten, Switzerland

    Knut Hinkelmann

  4. Graduate School of Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, 599-8531, Sakai, Osaka, Japan

    Koichi Kise

  5. KES International, P.O. Box 2115, BN43 9AF, Shoreham-by-sea, UK

    Robert J. Howlett

  6. University of South Australia, Mawson Lakes, 5095, Adelaide, SA, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Minarik, M., Sekanina, L. (2011). Evolution of Iterative Formulas Using Cartesian Genetic Programming. In: König, A., Dengel, A., Hinkelmann, K., Kise, K., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2011. Lecture Notes in Computer Science(), vol 6881. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23851-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23851-2_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23850-5

  • Online ISBN: 978-3-642-23851-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation