This HTML5 document contains 42 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n14http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n15http://localhost/temp/predkladatel/
n9http://purl.org/net/nknouf/ns/bibtex#
n24http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n21http://linked.opendata.cz/resource/domain/vavai/subjekt/
n7http://linked.opendata.cz/ontology/domain/vavai/
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F11%3A00184914%21RIV12-MSM-21230___/
n22http://linked.opendata.cz/resource/domain/vavai/zamer/
n10https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
rdfshttp://www.w3.org/2000/01/rdf-schema#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n11http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n13http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F11%3A00184914%21RIV12-MSM-21230___
rdf:type
n7:Vysledek skos:Concept
rdfs:seeAlso
http://dl.acm.org/citation.cfm?id=2001620
dcterms:description
This paper presents two extensions of recently proposed evolutionary-based iterative local search algorithm called POEMS for solving the Shortest Common Supersequence (SCS) problem. Both extensions improve scalability of the algorithm. The first one improves the efficiency of the evaluation procedure and the second one further improves optimization capabilities of the algorithm by intensifying the search towards short supersequence. The proposed algorithm performs very well, it produces significantly better solutions than the baseline Deposition and Reduction algorithm on large benchmarks. This paper presents two extensions of recently proposed evolutionary-based iterative local search algorithm called POEMS for solving the Shortest Common Supersequence (SCS) problem. Both extensions improve scalability of the algorithm. The first one improves the efficiency of the evaluation procedure and the second one further improves optimization capabilities of the algorithm by intensifying the search towards short supersequence. The proposed algorithm performs very well, it produces significantly better solutions than the baseline Deposition and Reduction algorithm on large benchmarks.
dcterms:title
Evolutionary-Based Iterative Local Search Algorithm for the Shortest Common Supersequence Problem Evolutionary-Based Iterative Local Search Algorithm for the Shortest Common Supersequence Problem
skos:prefLabel
Evolutionary-Based Iterative Local Search Algorithm for the Shortest Common Supersequence Problem Evolutionary-Based Iterative Local Search Algorithm for the Shortest Common Supersequence Problem
skos:notation
RIV/68407700:21230/11:00184914!RIV12-MSM-21230___
n7:predkladatel
n21:orjk%3A21230
n4:aktivita
n16:Z
n4:aktivity
Z(MSM6840770012)
n4:dodaniDat
n13:2012
n4:domaciTvurceVysledku
n24:1775022
n4:druhVysledku
n8:D
n4:duvernostUdaju
n18:S
n4:entitaPredkladatele
n17:predkladatel
n4:idSjednocenehoVysledku
198519
n4:idVysledku
RIV/68407700:21230/11:00184914
n4:jazykVysledku
n6:eng
n4:klicovaSlova
Combinatorial Optimization; Evolutionary Algorithms; Stochastic Local Search
n4:klicoveSlovo
n5:Evolutionary%20Algorithms n5:Combinatorial%20Optimization n5:Stochastic%20Local%20Search
n4:kontrolniKodProRIV
[FBA99AA54833]
n4:mistoKonaniAkce
Dublin
n4:mistoVydani
New York
n4:nazevZdroje
Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation
n4:obor
n19:JC
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
1
n4:rokUplatneniVysledku
n13:2011
n4:tvurceVysledku
Kubalík, Jiří
n4:typAkce
n14:WRD
n4:zahajeniAkce
2011-07-12+02:00
n4:zamer
n22:MSM6840770012
s:numberOfPages
8
n11:doi
10.1145/2001576.2001620
n9:hasPublisher
ACM
n10:isbn
978-1-4503-0557-0
n15:organizacniJednotka
21230