Přejít k obsahu


Cartesian Genetic Programming Using Bit

Citace: [] BURIAN, P. Cartesian Genetic Programming Using Bit. In TELFOR 2010 : proceedings. Belgrade: TELFOR, 2010. s. 803-806. ISBN: 978-86-7466-392-9
Druh: STAŤ VE SBORNÍKU
Jazyk publikace: cze
Anglický název: Cartesian Genetic Programming Using Bit
Rok vydání: 2010
Místo konání: Belgrade
Název zdroje: TELFOR
Autoři: Ing. Petr Burian
Abstrakt CZ: This paper deals with the evolutionary design of digital circuits. Concretely, it explores particular aspects of Cartesian Genetic Programming (CGP). The paper deals with the representation of a chromosome, especially the usage of a bit representation. An evolutionary algorithm using only bit operations is applied to CGP. Two circuits ? 3 bit x 2 bit multiplier and 5 bit majority circuit ? are used for algorithm power testing.
Abstrakt EN: This paper deals with the evolutionary design of digital circuits. Concretely, it explores particular aspects of Cartesian Genetic Programming (CGP). The paper deals with the representation of a chromosome, especially the usage of a bit representation. An evolutionary algorithm using only bit operations is applied to CGP. Two circuits ? 3 bit x 2 bit multiplier and 5 bit majority circuit ? are used for algorithm power testing.
Klíčová slova

Zpět

Patička