About: Efficient stochastic local search algorithm for solving the shortest common supersequence problem

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

About: Efficient stochastic local search algorithm for solving the shortest common supersequence problem 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	Recently, an application of the iterative optimization method called Prototype Optimization with Evolved Improvement Steps (POEMS) to the SCS problem has been proposed. This paper proposes a new time efficient evaluation procedure and a new moving-window strategy for constructing and refining the supersequence. These two enhancements significantly improve an efficiency of the approach. Series of experiments with the modified POEMS method have been carried out. Results presented in this paper show that the method is competitive with current state-of-the-art algorithms for solving the SCS problem. Recently, an application of the iterative optimization method called Prototype Optimization with Evolved Improvement Steps (POEMS) to the SCS problem has been proposed. This paper proposes a new time efficient evaluation procedure and a new moving-window strategy for constructing and refining the supersequence. These two enhancements significantly improve an efficiency of the approach. Series of experiments with the modified POEMS method have been carried out. Results presented in this paper show that the method is competitive with current state-of-the-art algorithms for solving the SCS problem. (en)
Title	Efficient stochastic local search algorithm for solving the shortest common supersequence problem Efficient stochastic local search algorithm for solving the shortest common supersequence problem (en)
skos:prefLabel	Efficient stochastic local search algorithm for solving the shortest common supersequence problem Efficient stochastic local search algorithm for solving the shortest common supersequence problem (en)
skos:notation	RIV/68407700:21230/10:00171014!RIV11-MSM-21230___
http://linked.open...avai/riv/aktivita	Z
http://linked.open...avai/riv/aktivity	Z(MSM6840770012)
http://linked.open...vai/riv/dodaniDat	2011
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	256406
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/10:00171014
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	optimization; evolutionary algorithms; shortest common supersequence problem (en)
http://linked.open.../riv/klicoveSlovo	evolutionary algorithms shortest common supersequence problem optimization
http://linked.open...ontrolniKodProRIV	[9989D82F4FCC]
http://linked.open...v/mistoKonaniAkce	Portland, Oregon
http://linked.open...i/riv/mistoVydani	New York
http://linked.open...i/riv/nazevZdroje	Proceedings of the 12th annual conference comp on Genetic and evolutionary computation
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	2010
http://linked.open...iv/tvurceVysledku	Kubalík, Jiří
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2010-07-07 (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-4503-0073-5
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