Investigating the performance of module acquisition in cartesian genetic programming

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 multipliers and digital comparators. We show that in most cases ECGP shows a substantial improvement in performance over CGP and that the computational speedup is more pronounced on larger problems. Categories and Subject Descriptors I.2.2 [Artificial Intelligence]: Automatic Programming – Program Synthesis. General Terms Algorithms, Design, Performance. Keywords Cartesian Genetic Programming, Module Acquisition, Modularity, Digital Adders, Digital Comparators, Digital Multipliers, Computational Effort.

• Type: Conference
• Year: 2005
• Where: GECCO
• Authors: James Alfred Walker, Julian Francis Miller
• Keywords: Cartesian Genetic Programming, Digital, Digital Adders, GECCO 2005