Publication Details

Providing Information from the Environment for Growing Electronic Circuits Through Polymorphic Gates

BIDLO Michal and SEKANINA Lukáš. Providing Information from the Environment for Growing Electronic Circuits Through Polymorphic Gates. In: Proc. of Genetic and Evolutionary Computation Conference - Workshops 2005. New York: Association for Computing Machinery, 2005, pp. 242-248. ISBN 1-59593-097-3.
Czech title
Polymorfní hradlo jako prostředek přenosu informace z prostředí rostoucím číslicovým obvodům
Type
conference paper
Language
english
Authors
URL
Keywords

Genetic algorithm, development, digital circuits design, polymorphic
circuit

Abstract

This paper deals with the evolutionary design of programs
(constructors) that are able to create (n+2)-input circuits
from n-input circuits. The growing circuits are composed of
polymorphic gates considered as building blocks. Therefore,
the growing circuit can specialize its functionality according
to environment which is sensed through polymorphic gates.
The work was performed using a simple circuit simulator.
We evolved constructors that are able to create arbitrarily
large polymorphic even/odd parity circuits and polymorphic
sorting networks.

Published
2005
Pages
242-248
Proceedings
Proc. of Genetic and Evolutionary Computation Conference - Workshops 2005
Conference
Genetic and Evolutionary Computation Conference, Washington D.C., US
ISBN
1-59593-097-3
Publisher
Association for Computing Machinery
Place
New York, US
BibTeX
@INPROCEEDINGS{FITPUB7809,
   author = "Michal Bidlo and Luk\'{a}\v{s} Sekanina",
   title = "Providing Information from the Environment for Growing Electronic Circuits Through Polymorphic Gates",
   pages = "242--248",
   booktitle = "Proc. of Genetic and Evolutionary Computation Conference - Workshops 2005",
   year = 2005,
   location = "New York, US",
   publisher = "Association for Computing Machinery",
   ISBN = "1-59593-097-3",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/7809"
}
Back to top