Conference paper

BIDLO Michal. A Benchmark for the Sorting Network Problem. In: Proc. of Genetic and Evolutionary Computation Conference - Workshops 2005. New York: Association for Computing Machinery, 2005, pp. 289-291. ISBN 1-59593-097-3.
Publication language:english
Original title:A Benchmark for the Sorting Network Problem
Title (cs):Benchmark pro řadicí sítě
Pages:289-291
Proceedings:Proc. of Genetic and Evolutionary Computation Conference - Workshops 2005
Conference:Genetic and Evolutionary Computation Conference
Place:New York, US
Year:2005
ISBN:1-59593-097-3
Publisher:Association for Computing Machinery
URL:http://www.fit.vutbr.cz/~bidlom/Papers/2005/gecco2005_workshop1.pdf [PDF]
Keywords
Sorting network, benchmark
Annotation
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).
BibTeX:
@INPROCEEDINGS{
   author = {Michal Bidlo},
   title = {A Benchmark for the Sorting Network Problem},
   pages = {289--291},
   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 = {http://www.fit.vutbr.cz/research/view_pub.php?id=7810}
}

Your IPv4 address: 54.81.131.189
Switch to IPv6 connection

DNSSEC [dnssec]