Publication Details

A Benchmark for the Sorting Network Problem

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.
Czech title
Benchmark pro řadicí sítě
Type
conference paper
Language
english
Authors
Bidlo Michal, doc. Ing., Ph.D. (DCSY FIT BUT)
URL
Keywords

Sorting network, benchmark

Abstract

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).

Published
2005
Pages
289-291
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{FITPUB7810,
   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 = "https://www.fit.vut.cz/research/publication/7810"
}
Back to top