About: Solving the Sorting Network Problem Using Iterative Optimization with Evolved Hypermutations

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Solving the Sorting Network Problem Using Iterative Optimization with Evolved Hypermutations Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	This paper presents an application of a prototype optimization with evolved improvement steps algorithm (POEMS) to the well-known problem of optimal sorting network design. The POEMS is an iterative algorithm that seeks the best variation of the current solution in each iteration. For experimental evaluation 10-input, 12-input, 14-input and 16-input instances of the sorting network problem were used. Results show that the proposed POEMS approach clearly outperforms both compared algorithms. Moreover, POEMS was able to find several perfect networks that are equivalent w.r.t. the number of comparators to the best known solutions for the 10-input, 12-input, 14-input, and 16-input problems. This paper presents an application of a prototype optimization with evolved improvement steps algorithm (POEMS) to the well-known problem of optimal sorting network design. The POEMS is an iterative algorithm that seeks the best variation of the current solution in each iteration. For experimental evaluation 10-input, 12-input, 14-input and 16-input instances of the sorting network problem were used. Results show that the proposed POEMS approach clearly outperforms both compared algorithms. Moreover, POEMS was able to find several perfect networks that are equivalent w.r.t. the number of comparators to the best known solutions for the 10-input, 12-input, 14-input, and 16-input problems. (en)
Title	Solving the Sorting Network Problem Using Iterative Optimization with Evolved Hypermutations Solving the Sorting Network Problem Using Iterative Optimization with Evolved Hypermutations (en)
skos:prefLabel	Solving the Sorting Network Problem Using Iterative Optimization with Evolved Hypermutations Solving the Sorting Network Problem Using Iterative Optimization with Evolved Hypermutations (en)
skos:notation	RIV/68407700:21230/09:00156838!RIV10-MSM-21230___
http://linked.open...avai/riv/aktivita	Z
http://linked.open...avai/riv/aktivity	Z(MSM6840770012)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Kubalík, Jiří
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	342324
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/09:00156838
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	combinatorial optimization; evolutionary algorithms (en)
http://linked.open.../riv/klicoveSlovo	evolutionary algorithms combinatorial optimization
http://linked.open...ontrolniKodProRIV	[F267E00A3643]
http://linked.open...v/mistoKonaniAkce	Montreal
http://linked.open...i/riv/mistoVydani	New York
http://linked.open...i/riv/nazevZdroje	Genetic and Evolutionary Computation Conference 2009
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...UplatneniVysledku	2009
http://linked.open...iv/tvurceVysledku	Kubalík, Jiří
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2009-07-08 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Transdisciplinární výzkum v oblasti biomedicínského inženýrství II
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	ACM
https://schema.org/isbn	978-1-60558-325-9
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software