Cartesian genetic programming
This article needs more links to other articles to help integrate it into the encyclopedia. (April 2019) (Learn how and when to remove this template message)
Cartesian genetic programming is a form of genetic programming that uses a graph representation to encode computer programs. It grew from a method of evolving digital circuits developed by Julian F. Miller et al. in 1997. The term ‘Cartesian genetic programming’ first appeared in 1999 and was proposed as a general form of genetic programming in 2000. It is called ‘Cartesian’ because it represents a program using a two-dimensional grid of nodes.
- Miller, J.F., Thomson, P., Fogarty, T.C.: Designing Electronic Circuits Using Evolutionary Algorithms: Arithmetic Circuits: A Case Study. In: D. Quagliarella, J. Periaux, C. Poloni, G. Winter (eds.) Genetic Algorithms and Evolution Strategies in Engineering and Computer Science: Recent Advancements and Industrial Applications, pp. 105–131. Wiley (1998)
- Miller, J.F.: An Empirical Study of the Efficiency of Learning Boolean Functions using a Cartesian Genetic Programming Approach. In: Proc. Genetic and Evolutionary Computation Conference, pp. 1135–1142. Morgan Kaufmann (1999)
- Miller, J.F., Thomson, P.: Cartesian Genetic Programming. In: Proc. European Conference on Genetic Programming, LNCS, vol. 1802, pp. 121–132. Springer (2000)
- "CGP home". www.cartesiangp.com. Retrieved 2018-08-02.
- Miller, Julian F., ed. (2011). Cartesian Genetic Programming. Natural Computing Series. CiteSeerX 10.1.1.8.3777. doi:10.1007/978-3-642-17310-3. ISBN 978-3-642-17309-7. ISSN 1619-7127.
|This computer-programming-related article is a stub. You can help Wikipedia by expanding it.|