• DocumentCode
    226411
  • Title

    Compact version of Cartesian Genetic Programming

  • Author

    Burian, Petr

  • Author_Institution
    Dept. of Appl. Electron. & Telecommun., Univ. of West Bohemia, Pilsen, Czech Republic
  • fYear
    2014
  • fDate
    9-10 Sept. 2014
  • Firstpage
    63
  • Lastpage
    66
  • Abstract
    This paper deals with the design of the compact version of Cartesian Genetic Programming. The focus is given to the search algorithm of type (1+1). The paper presents the approach that detects changes in the phenotype and, based on that, the algorithm can omit the evaluation of a candidate solution. The author uses the evolutionary design of multipliers as benchmark to present the efficiency of the algorithm.
  • Keywords
    genetic algorithms; search problems; Cartesian genetic programming; candidate solution evaluation; evolutionary design; multipliers; type (1+1) search algorithm; Algorithm design and analysis; Benchmark testing; Cells (biology); Cost accounting; Genetic programming; Integrated circuit interconnections; CGP; Cartesian Genetic Programming; Evolutionary design; Fitness function;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Applied Electronics (AE), 2014 International Conference on
  • Conference_Location
    Pilsen
  • ISSN
    1803-7232
  • Print_ISBN
    978-8-0261-0276-2
  • Type

    conf

  • DOI
    10.1109/AE.2014.7011669
  • Filename
    7011669
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=226411