Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
BIDLO, M.
Originální název
A Benchmark for the Sorting Network Problem
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
angličtina
Originální abstrakt
The paper introduces an overview of sorting networks created by means of a method discovered by genetic algorithm with development. The results are compared with conventional sorting networks. Genetic algorithm discovered a constructor (program for the sorting networks construction) that is able to create arbitrarily large sorting network from a given initial instance, whose properties are substantially better than the sorting networks of the same size created by means of a conventional technique (e.g. bubble-sort network).
Klíčová slova
Sorting network, benchmark
Autoři
Rok RIV
2005
Vydáno
25. 6. 2005
Nakladatel
Association for Computing Machinery
Místo
New York
ISBN
1-59593-097-3
Kniha
Proc. of Genetic and Evolutionary Computation Conference - Workshops 2005
Strany od
289
Strany do
291
Strany počet
3
URL
http://www.fit.vutbr.cz/~bidlom/Papers/2005/gecco2005_workshop1.pdf
BibTex
@inproceedings{BUT21514, author="Michal {Bidlo}", title="A Benchmark for the Sorting Network Problem", booktitle="Proc. of Genetic and Evolutionary Computation Conference - Workshops 2005", year="2005", pages="289--291", publisher="Association for Computing Machinery", address="New York", isbn="1-59593-097-3", url="http://www.fit.vutbr.cz/~bidlom/Papers/2005/gecco2005_workshop1.pdf" }