Detail výsledku

A Benchmark for the Sorting Network Problem

BIDLO, M. A Benchmark for the Sorting Network Problem. Proc. of Genetic and Evolutionary Computation Conference - Workshops 2005. New York: Association for Computing Machinery, 2005. p. 289-291. ISBN: 1-59593-097-3.
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Bidlo Michal, doc. Ing., Ph.D., UPSY (FIT)
Abstrakt

The paper introduces an overview of sorting networks created by meansof a method discovered by genetic algorithm with development. Theresults are compared with conventional sorting networks. Geneticalgorithm discovered a constructor (program for the sorting networksconstruction) that is able to create arbitrarily large sorting networkfrom a given initial instance, whose properties are substantiallybetter than the sorting networks of the same size created by means of aconventional technique (e.g. bubble-sort network).

Klíčová slova

Sorting network, benchmark

URL
Rok
2005
Strany
289–291
Sborník
Proc. of Genetic and Evolutionary Computation Conference - Workshops 2005
Konference
Genetic and Evolutionary Computation Conference
ISBN
1-59593-097-3
Vydavatel
Association for Computing Machinery
Místo
New York
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"
}
Projekty
Moderní metody syntézy číslicových systémů, GAČR, Standardní projekty, GA102/04/0737, zahájení: 2004-01-01, ukončení: 2006-12-31, ukončen
Pracoviště
Ústav počítačových systémů (UPSY)
Nahoru