Downloads
Reported Results
Results for CGP and Modular CGP applied to the problems reported in the journal paper "Automatic Acquisition, Evolution and Re-use of Modules in Cartesian Genetic Programming" are available for download, so other researchers may perform statistical significance tests with other techniques:
Even Parity
- CGP applied to the even 3 up to the even 8 parity problems
- Modular CGP applied to the even 3 up to the even 8 parity problems
Digital Adders
- CGP applied to the 1-bit, 2-bit and 3-bit digital adder problems
- Modular CGP applied to the 1-bit, 2-bit and 3-bit digital adder problems
Digital Comparators
- CGP applied to the 1-bit, 2-bit and 3-bit digital comparator problems
- Modular CGP applied to the 1-bit, 2-bit and 3-bit digital comparator problems
Digital Multipliers
- CGP applied to the 1-bit, 2-bit and 3-bit digital multiplier problems
- Modular CGP applied to the 1-bit, 2-bit and 3-bit digital multiplier problems
Symbolic Regression
- CGP applied to the symbolic regression problems x6-2x4+x2 and x5-2x3+x
- Modular CGP (module size 3) applied to the symbolic regression problems x6-2x4+x2 and x5-2x3+x
- Modular CGP (module size 5) applied to the symbolic regression problems x6-2x4+x2 and x5-2x3+x
- Modular CGP (module size 8) applied to the symbolic regression problems x6-2x4+x2 and x5-2x3+x
Lawnmower Problem
- CGP applied to the lawnmower problem with 32 square lawns up to 256 square lawns
- Modular CGP applied to the lawnmower problem with 32 square lawns up to 256 square lawns
Hierarchical If-and-only-if (H-IFF)
- CGP applied to the 8-bit up to the 256-bit H-IFF problems
- Modular CGP (module size 3) applied to the 8-bit up to the 256-bit H-IFF problems
- Modular CGP (module size 5) applied to the 8-bit up to the 256-bit H-IFF problems
- Modular CGP (module size 8) applied to the 8-bit up to the 256-bit H-IFF problems
