Evolutionary Design of Arbitrarily Large Sorting Networks Using Development

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F05%3APU55719" target="_blank" >RIV/00216305:26230/05:PU55719 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Evolutionary Design of Arbitrarily Large Sorting Networks Using Development
Original language description
An evolutionary algorithm is combined with an application-specific developmental scheme in order to evolve efficient arbitrarily large sorting networks. First, a small sorting network (that we call the embryo) has to be prepared to solve the trivial instance of a problem. Then the evolved program (the constructor) is applied on the embryo to create a larger sorting network (solving a larger instance of the problem). Then the same constructor is used to create a new instance of the sorting network from tthe created larger sorting network and so on. The proposed approach allowed us to rediscover the conventional principle of insertion which is traditionally used for constructing large sorting networks. Furthermore, the principle was improved by meansof the evolutionary technique. The evolved sorting networks exhibit a lower implementation cost and delay.
Czech name
Evoluční návrh libovolně velkých řadicích sítí s využitím developmentu
Czech description
Článek popisuje metodu evolučního návrhu libovolně velkých řadicích sítí s využitím developmentu.

Project
<a href="/en/project/GP102%2F03%2FP004" target="_blank" >GP102/03/P004: Evolvable hardware based applications design methods</a>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2005
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)