About: O (n log n) filtering algorithms for unary resource constraint     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)

AttributesValues
rdf:type
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). (en)
  • Č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í. (cs)
Title
  • O (n log n) filtering algorithms for unary resource constraint
  • O (n log n) filtering algorithms for unary resource constraint (en)
  • O (n log n) filtrovací algorithmy pro unární omezení zdrojů (cs)
skos:prefLabel
  • O (n log n) filtering algorithms for unary resource constraint
  • O (n log n) filtering algorithms for unary resource constraint (en)
  • O (n log n) filtrovací algorithmy pro unární omezení zdrojů (cs)
skos:notation
  • RIV/00216208:11320/04:00005578!RIV08-MSM-11320___
http://linked.open.../vavai/riv/strany
  • 335;347
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/04/1102), Z(MSM 113200005)
http://linked.open...iv/cisloPeriodika
  • 1
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 577046
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/04:00005578
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • filtering; algorithms; unary; resource; constraint (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • DE - Spolková republika Německo
http://linked.open...ontrolniKodProRIV
  • [39ABB3BA51CE]
http://linked.open...i/riv/nazevZdroje
  • Lecture Notes In Computer Science
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 3011
http://linked.open...iv/tvurceVysledku
  • Vilím, Petr
http://linked.open...n/vavai/riv/zamer
issn
  • 0302-9743
number of pages
http://localhost/t...ganizacniJednotka
  • 11320
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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, 49 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software