. "P\u0159\u00EDsp\u011Bvek poskytuje p\u0159ehled parametr\u016F libovoln\u011B velk\u00FDch \u0159adic\u00EDch s\u00EDt\u00ED v\u00FDtvo\u0159en\u00FDch pomoc\u00ED metody objeven\u00E9 genetick\u00FDm algoritmem s vyu\u017Eit\u00EDm v\u00FDvojov\u00E9ho modelu (development). Je uvedeno srovn\u00E1n\u00ED z\u00EDskan\u00FDch v\u00FDsledk\u016F s konven\u010Dn\u00EDmi strukturami. Genetick\u00FD algoritmus nalezl konstruktor (program pro tvorbu \u0159adic\u00EDch c\u00EDt\u00ED), kter\u00FD je schopen vytvo\u0159it libovoln\u011B velkou \u0159adic\u00ED s\u00ED\u0165 z dan\u00E9ho po\u010D\u00E1te\u010Dn\u00EDho \u0159e\u0161en\u00ED, jej\u00ED\u017E parametry jsou podstatn\u011B lep\u0161\u00ED ne\u017E u stejn\u011B velk\u00E9 \u0159adic\u00ED s\u00EDt\u011B vytvo\u0159en\u00E9 konven\u010Dn\u00EDm algoritmem (nap\u0159. bubblle-sort).
"@cs . "A Benchmark for the Sorting Network Problem"@en . . "Washington D.C." . "3"^^ . "2005-06-25+02:00"^^ . . . . . . "[F60174FDAF02]" . "New York" . "A Benchmark for the Sorting Network Problem" . . "A Benchmark for the Sorting Network Problem" . "RIV/00216305:26230/05:PU56422" . . "1"^^ . "P(GA102/04/0737)" . "1"^^ . . "Sorting network, benchmark
"@en . "A Benchmark for the Sorting Network Problem"@en . "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).
"@en . "Proc. of Genetic and Evolutionary Computation Conference - Workshops 2005" . "289-291" . . "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).
" . "Benchmark pro \u0159adic\u00ED s\u00EDt\u011B"@cs . . . "Benchmark pro \u0159adic\u00ED s\u00EDt\u011B"@cs . "26230" . . . "Association for Computing Machinery" . "510753" . "RIV/00216305:26230/05:PU56422!RIV06-GA0-26230___" . "Bidlo, Michal" . "1-59593-097-3" .