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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n4http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n15http://linked.opendata.cz/resource/domain/vavai/projekt/
n13http://linked.opendata.cz/ontology/domain/vavai/
n17http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
n14http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F04%3A00005578%21RIV08-MSM-11320___/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F04%3A00005578%21RIV08-MSM-11320___
rdf:type
skos:Concept n13:Vysledek
dcterms:description
So far, edge-finding is the only one major filtering algorithm for unary resource constraint with time complexity O(n log n). This paper proposes O(n log n) versions of another two filtering algorithms: not-first/not-last and propagation of detectable precedences. These two algorithms can be used together with the edge-finding to further improve the filtering. This paper also propose new O (n log n) implementation of fail detection (overload checking). So far, edge-finding is the only one major filtering algorithm for unary resource constraint with time complexity O(n log n). This paper proposes O(n log n) versions of another two filtering algorithms: not-first/not-last and propagation of detectable precedences. These two algorithms can be used together with the edge-finding to further improve the filtering. This paper also propose new O (n log n) implementation of fail detection (overload checking). Článek popisuje O(n log n) verze dvou filtrovacích algoritmů pro unární omezení zdrojů: ne-první/ne-poslední a propagace detekovatelných precedencí.
dcterms:title
O (n log n) filtering algorithms for unary resource constraint O (n log n) filtrovací algorithmy pro unární omezení zdrojů O (n log n) filtering algorithms for unary resource constraint
skos:prefLabel
O (n log n) filtering algorithms for unary resource constraint O (n log n) filtering algorithms for unary resource constraint O (n log n) filtrovací algorithmy pro unární omezení zdrojů
skos:notation
RIV/00216208:11320/04:00005578!RIV08-MSM-11320___
n6:strany
335;347
n6:aktivita
n11:Z n11:P
n6:aktivity
P(GA201/04/1102), Z(MSM 113200005)
n6:cisloPeriodika
1
n6:dodaniDat
n7:2008
n6:domaciTvurceVysledku
n19:2005980
n6:druhVysledku
n16:J
n6:duvernostUdaju
n10:S
n6:entitaPredkladatele
n14:predkladatel
n6:idSjednocenehoVysledku
577046
n6:idVysledku
RIV/00216208:11320/04:00005578
n6:jazykVysledku
n18:eng
n6:klicovaSlova
filtering; algorithms; unary; resource; constraint
n6:klicoveSlovo
n8:constraint n8:unary n8:filtering n8:resource n8:algorithms
n6:kodStatuVydavatele
DE - Spolková republika Německo
n6:kontrolniKodProRIV
[39ABB3BA51CE]
n6:nazevZdroje
Lecture Notes In Computer Science
n6:obor
n12:BA
n6:pocetDomacichTvurcuVysledku
1
n6:pocetTvurcuVysledku
1
n6:projekt
n15:GA201%2F04%2F1102
n6:rokUplatneniVysledku
n7:2004
n6:svazekPeriodika
3011
n6:tvurceVysledku
Vilím, Petr
n6:zamer
n17:MSM%20113200005
s:issn
0302-9743
s:numberOfPages
13
n4:organizacniJednotka
11320