Cartesian genetic programming: Difference between revisions
CSV import |
CSV import |
||
| Line 3: | Line 3: | ||
{{stb}} | {{stb}} | ||
{{dictionary-stub1}} | {{dictionary-stub1}} | ||
{{No image}} | |||
Revision as of 10:28, 10 February 2025
- 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 and Peter Thomson 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's website explains how CGP works. He edited a book entitled Cartesian genetic Programming, published in 2011 by Springer. [[Category:Uncategorized
| This article is a stub. You can help WikiMD by registering to expand it. |
