Revision as of 17:49, 27 October 2018 edit 155.98.131.6 (talk) Website url out of date ← Previous edit		Revision as of 03:23, 12 January 2019 edit undo Citation bot (talk \| contribs) Bots 5,864,840 edits m Alter: template type. Add: citeseerx, isbn. Removed parameters. \| You can use this bot yourself. Report bugs here. \| User-activated. Next edit →
Line 3: Genetic Programming, LNCS, vol. 1802, pp. 121–132. Springer (2000)</ref>. It is called ‘Cartesian’ because it represents a program using a two-dimensional grid of nodes. Julian F. Miller (the inventor of CGP) has a web site<ref>{{Cite web\|url=http://www.cartesiangp.com\|title=CGP home\|website=www.cartesiangp.com\|access-date=2018-08-02}}</ref> which explains how CGP works. You can download many publications about CGP from this site. He also edited a book titled 'Cartesian Genetic Programming<ref>{{Cite ~~journal~~book\|date=2011\|editor-last=Miller\|editor-first=Julian F.\|title=Cartesian Genetic Programming~~\|url=https://link.springer.com/book/10.1007/978-3-642-17310-3~~\|journal=Natural Computing Series\|language=en-gb\|doi=10.1007/978-3-642-17310-3\|issn=1619-7127\|isbn=978-3-642-17309-7\|citeseerx=10.1.1.8.3777}}</ref>', published in 2011 by Springer. == References ==

Cartesian genetic programming: Difference between revisions