By the same authors

Investigating the performance of module acquisition in Cartesian Genetic Programming

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Author(s)

Department/unit(s)

Publication details

Title of host publicationGECCO 2005: Genetic and Evolutionary Computation Conference, Vols 1 and 2
DatePublished - 2005
Pages1649-1656
Number of pages8
PublisherASSOC COMPUTING MACHINERY
Place of PublicationNEW YORK
EditorsHG Beyer
Original languageEnglish
ISBN (Print)1-59593-010-8

Abstract

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.

    Research areas

  • algorithms, design, performance, Cartesian Genetic Programming, module acquisition, modularity, digital adders, digital comparators, digital multipliers, computational effort, NEUTRALITY, LANDSCAPE

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations