Cartesian genetic programming
Cartesian genetic programming
复制标题
DOI：
10.1145/1570256.1570428
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
J. Miller;Simon Harding
中科院分区：
文献类型：
--
作者：
J. Miller;Simon Harding
笛卡尔遗传规划是遗传规划的一种形式。它越来越受欢迎。它是由Julian米勒和Peter Thomson在1997年开发的。在它的经典形式中，它使用了一个非常简单的基于整数的遗传表示的程序的形式，一个有向图。在许多研究中，它已被证明是有效的，与其他GP技术相比。从那时起，CGP的经典形式通过包括自动定义的函数而以各种方式得到增强。最近，它已经由Julian米勒，Wolfgang Banzhaf和Simon Harding开发，包括自修改算子。这再次提高了它的效率。本教程将涵盖基本技术，高级开发和应用到各种问题领域。
Cartesian Genetic Programming is a form of genetic programming. It is increasing in popularity. It was developed by Julian Miller with Peter Thomson in 1997. In its classic form it uses a very simple integer based genetic representation of a program in the form of a directed graph. In a number of studies, it has been shown to be efficient in comparison with other GP techniques. Since then, the classical form of CGP has been enhanced in various ways by including automatically defined functions. Most recently, it has been developed by Julian Miller, Wolfgang Banzhaf and Simon Harding to include self-modification operators. This again has increased its efficiency. The tutorial will cover the basic technique, advanced developments and applications to a variety of problem domains.