Results 1 - 10 of 11,608

Cartesian Genetic Programming

by Julian F. Miller , Peter Thomson , 2000
"... This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form of a linear string of integers. The inputs or terminal set and node outputs are numbered sequentially. The node funct ..."
Abstract - Cited by 230 (59 self) - Add to MetaCart
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form of a linear string of integers. The inputs or terminal set and node outputs are numbered sequentially. The node

Recurrent Cartesian Genetic Programming

by Andrew James Turner, Julian Francis Miller
"... Abstract. This paper formally introduces Recurrent Cartesian Genetic Programming (RCGP), an extension to Cartesian Genetic Programming (CGP) which allows recurrent connections. The presence of recurrent connections enables RCGP to be successfully applied to partially ob-servable tasks. It is found t ..."
Abstract - Add to MetaCart
Abstract. This paper formally introduces Recurrent Cartesian Genetic Programming (RCGP), an extension to Cartesian Genetic Programming (CGP) which allows recurrent connections. The presence of recurrent connections enables RCGP to be successfully applied to partially ob-servable tasks. It is found

Self-Modifying Cartesian Genetic Programming

by Simon Harding, Julian F. Miller, Wolfgang Banzhaf , 2007
"... In nature, systems with enormous numbers of components (i.e. cells) are evolved from a relatively small genotype. It has not yet been demonstrated that artificial evolution is sufficient to make such a system evolvable. Consequently researchers have been investigating forms of computational developm ..."
Abstract - Cited by 27 (14 self) - Add to MetaCart
of Cartesian Genetic Programming that includes self-modification operations. One advantage of this approach is that ab initio the system can be used to solve computational problems. We present results on a number of problems and demonstrate the characteristics and advantages that self-modification brings.

Hardware accelerators for cartesian genetic programming

by Zdenek Vasicek, Lukas Sekanina - In Proceedings of the 11th European conference on Genetic programming, EuroGP’08 , 2008
"... Abstract. A new class of FPGA-based accelerators is presented for Cartesian Genetic Programming (CGP). The accelerators contain a ge-netic engine which is reused in all applications. Candidate programs (circuits) are evaluated using application-specific virtual reconfigurable circuit (VRC) and fitne ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
Abstract. A new class of FPGA-based accelerators is presented for Cartesian Genetic Programming (CGP). The accelerators contain a ge-netic engine which is reused in all applications. Candidate programs (circuits) are evaluated using application-specific virtual reconfigurable circuit (VRC

Evolutionary Art with Cartesian Genetic Programming

by Laurence Ashmore, Julian Francis Miller
"... Abstract. Techniques from the field of Evolutionary Computation are used to evolve a wide variety of aesthetically pleasing images using Cartesian Genetic Programming (CGP). The challenges that arise from employing a fitness func-tion based on aesthetics, and the benefits that CGP can provide, are i ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Abstract. Techniques from the field of Evolutionary Computation are used to evolve a wide variety of aesthetically pleasing images using Cartesian Genetic Programming (CGP). The challenges that arise from employing a fitness func-tion based on aesthetics, and the benefits that CGP can provide

A New Crossover Technique for Cartesian Genetic Programming

by Janet Clegg, et al. , 2007
"... Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents ’ trees are swapped to create the offspring. Later Miller and Thomson introduced Cartesian Genetic Programming, which uses directed graphs as a r ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents ’ trees are swapped to create the offspring. Later Miller and Thomson introduced Cartesian Genetic Programming, which uses directed graphs as a

What bloat? Cartesian Genetic Programming on Boolean problems

by Julian Miller - 2001 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE LATE BREAKING PAPERS , 2001
"... This paper presents an empirical study of the variation of program size over time, for a form of Genetic Programming called Cartesian Genetic Programming. Two main types of Cartesian genetic programming are examined: one uses a fully connected graph, with no redundant nodes, while the other al ..."
Abstract - Cited by 18 (6 self) - Add to MetaCart
This paper presents an empirical study of the variation of program size over time, for a form of Genetic Programming called Cartesian Genetic Programming. Two main types of Cartesian genetic programming are examined: one uses a fully connected graph, with no redundant nodes, while the other

Investigating the performance of module acquisition in cartesian genetic programming

by James Alfred Walker - In Proc. of the 2005 Genetic and Evolutionary Computation Conference , 2005
"... Embedded Cartesian Genetic Programming (ECGP) is a form of the graph based Cartesian Genetic Programming (CGP) in which modules are automatically acquired and evolved. In this paper we compare the efficiencies of the ECGP and CGP techniques on three classes of problem: digital adders, digital multip ..."
Abstract - Cited by 8 (5 self) - Add to MetaCart
Embedded Cartesian Genetic Programming (ECGP) is a form of the graph based Cartesian Genetic Programming (CGP) in which modules are automatically acquired and evolved. In this paper we compare the efficiencies of the ECGP and CGP techniques on three classes of problem: digital adders, digital

Evolution and Acquisition of Modules in Cartesian Genetic Programming

by James Alfred Walker, Julian Francis Miller - In Proc. of the 7th European Conference on Genetic Programming, volume 3003 of LNCS , 2004
"... Abstract. The paper presents for the first time automatic module acquisition and evolution within the graph based Cartesian Genetic Programming method. The method has been tested on a set of even parity problems and compared with Cartesian Genetic Programming without modules. Results are given that ..."
Abstract - Cited by 25 (14 self) - Add to MetaCart
Abstract. The paper presents for the first time automatic module acquisition and evolution within the graph based Cartesian Genetic Programming method. The method has been tested on a set of even parity problems and compared with Cartesian Genetic Programming without modules. Results are given

A SURVEY OF SELF MODIFYING CARTESIAN GENETIC PROGRAMMING

by Simon Harding, Wolfgang Banzhaf, Julian F. Miller , 2011
"... Self-Modifying Cartesian Genetic Programming (SMCGP) is a general purpose, graph-based, developmental form of Cartesian Genetic Programming. In addition to the usual computational functions found in CGP, SMCGP includes functions that can modify the evolved program at run time. This means that progra ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
Self-Modifying Cartesian Genetic Programming (SMCGP) is a general purpose, graph-based, developmental form of Cartesian Genetic Programming. In addition to the usual computational functions found in CGP, SMCGP includes functions that can modify the evolved program at run time. This means
Results 1 - 10 of 11,608