Loading...
Please wait, while we are loading the content...
Similar Documents
Embedded cartesian genetic programming and the lawnmower and hierarchical-if-and-only-if problems (2006)
| Content Provider | CiteSeerX |
|---|---|
| Author | Walker, James Alfred |
| Description | In Proc. of GECCO. ACM |
| Abstract | 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 well known Lawnmower problem and to the Hierarchical-if-and-Only-if problem. The latter is normally associated with Genetic Algorithms. Computational effort figures are calculated from the results of both CGP and ECGP and our results compare favourably with other techniques. |
| File Format | |
| Publisher Date | 2006-01-01 |
| Access Restriction | Open |
| Subject Keyword | Re-using Partial Solution Hierarchical-if-and-only-if Problem Computational Effort Figure Cartesian Genetic Programming Lawnmower Problem |
| Content Type | Text |
