Cellular Automaton as a Sorting Network Generator Using Instruction-Based Development

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F12%3APU101782" target="_blank" >RIV/00216305:26230/12:PU101782 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007%2F978-3-642-33350-7_22" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-642-33350-7_22</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-33350-7_22" target="_blank" >10.1007/978-3-642-33350-7_22</a>

Result language
angličtina
Original language name
Cellular Automaton as a Sorting Network Generator Using Instruction-Based Development
Original language description
A new cellular automaton-based approach allowing to generate sorting networks is presented. Since the traditional table-based transition function in this case involves excessive number of rules, a program-based representation of the transition function is applied. The sorting networks are encoded by the cell states and generated during the cellular automaton development. The obtained results are compared with our previous approaches utilizing cellular automata.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
OECD FORD branch
—

Project
<a href="/en/project/GAP103%2F10%2F1517" target="_blank" >GAP103/10/1517: Natural Computing on Unconventional Platforms</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)