Results 1 - 10
of
258
Improving the Evolvability of Digital Multipliers Using Embedded Cartesian Genetic Programming and Product Reduction
- Proceedings of 6th International Conference in Evolvable Systems. Springer, LNCS 3637
, 2005
"... Abstract. Embedded Cartesian Genetic Programming (ECGP) is a form of Ge-netic Programming based on an acyclic directed graph representation. In this paper we investigate the use of ECGP together with a technique called Product Reduction (PR) to reduce the time required to evolve a digital multiplier ..."
Abstract
-
Cited by 10 (5 self)
- Add to MetaCart
Abstract. Embedded Cartesian Genetic Programming (ECGP) is a form of Ge-netic Programming based on an acyclic directed graph representation. In this paper we investigate the use of ECGP together with a technique called Product Reduction (PR) to reduce the time required to evolve a digital
Embedded cartesian genetic programming and the lawnmower and hierarchical-if-and-only-if problems
- In Proc. of GECCO. ACM
, 2006
"... Embedded Cartesian Genetic Programming (ECGP) is an extension of the directed graph based Cartesian Genetic Programming (CGP), which is capable of automatically acquiring, evolving and re-using partial solutions in the form of modules. In this paper, we apply for the first time, CGP and ECGP to the ..."
Abstract
-
Cited by 6 (5 self)
- Add to MetaCart
Embedded Cartesian Genetic Programming (ECGP) is an extension of the directed graph based Cartesian Genetic Programming (CGP), which is capable of automatically acquiring, evolving and re-using partial solutions in the form of modules. In this paper, we apply for the first time, CGP and ECGP
Improving the Evolvability of Digital Multipliers using Embedded Cartesian Genetic Programming and Product Reduction
"... Abstract. Embedded Cartesian Genetic Programming (ECGP) is a form of Genetic Programming based on an acyclic directed graph representation. In this paper we investigate the use of ECGP together with a technique called Product Reduction (PR) to reduce the time required to evolve a digital multiplier. ..."
Abstract
- Add to MetaCart
Abstract. Embedded Cartesian Genetic Programming (ECGP) is a form of Genetic Programming based on an acyclic directed graph representation. In this paper we investigate the use of ECGP together with a technique called Product Reduction (PR) to reduce the time required to evolve a digital multiplier
Investigating the performance of module acquisition in cartesian genetic programming
- 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
Cartesian Genetic Programming
, 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
Changing the genospace: Solving ga problems with cartesian genetic programming
- In Proc. of EuroGP 2007
, 2007
"... Abstract. Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) capable of acquiring, evolving and re-using partial solutions. In this paper, we apply for the first time CGP and ECGP to the ones-max and order-3 deceptive problems, which are normally ass ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
Abstract. Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) capable of acquiring, evolving and re-using partial solutions. In this paper, we apply for the first time CGP and ECGP to the ones-max and order-3 deceptive problems, which are normally
Genetic Programming Track
"... Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) that can automatically acquire, evolve and re-use partial solutions in the form of modules. In this paper, we introduce for the first time a new multi-chromosome approach to CGP and ECGP that allows ..."
Abstract
- Add to MetaCart
Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) that can automatically acquire, evolve and re-use partial solutions in the form of modules. In this paper, we introduce for the first time a new multi-chromosome approach to CGP and ECGP that allows
Recurrent Cartesian Genetic Programming
"... 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
, 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.
CARTESIAN GENETIC PROGRAMMING FOR IMAGE PROCESSING
"... Combining domain knowledge about both imaging processing and machine learning techniques can expand the abilities of Genetic Programming when used for image processing. We successfully demonstrate our new approach on several different problem domains. We show that the approach is fast, scalable and ..."
Abstract
-
Cited by 14 (8 self)
- Add to MetaCart
Combining domain knowledge about both imaging processing and machine learning techniques can expand the abilities of Genetic Programming when used for image processing. We successfully demonstrate our new approach on several different problem domains. We show that the approach is fast, scalable
Results 1 - 10
of
258