About: Incremental Filtering Algorithms for Precedence and Dependency Constraints     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
  • Článek pojednává o integraci precedenčních a dependenčních podmínek v rámci temporálních sítí. Konkrétně jsou popsána inkrementální pravidla pro odstraňování nekonzistencí. (cs)
  • Precedence constraints specify that an activity must finish before another activity starts and hence such constraints play a crucial role in planning and scheduling problems. Many real-life problems also include dependency constraints expressing logical relations between the activities for example, an activity requires presence of another activity in the plan. For such problems a typical objective is a maximization of the number of activities satisfying the precedence and dependency constraints. In the paper we propose new incremental filtering rules integrating propagation through both precedence and dependency constraints. We also propose a new filtering rule using the information about the requested number of activities in the plan. We demonstrate efficiency of the proposed rules on log-based reconciliation problems and min-cutset problems.
  • Precedence constraints specify that an activity must finish before another activity starts and hence such constraints play a crucial role in planning and scheduling problems. Many real-life problems also include dependency constraints expressing logical relations between the activities for example, an activity requires presence of another activity in the plan. For such problems a typical objective is a maximization of the number of activities satisfying the precedence and dependency constraints. In the paper we propose new incremental filtering rules integrating propagation through both precedence and dependency constraints. We also propose a new filtering rule using the information about the requested number of activities in the plan. We demonstrate efficiency of the proposed rules on log-based reconciliation problems and min-cutset problems. (en)
Title
  • Incremental Filtering Algorithms for Precedence and Dependency Constraints
  • Incremental Filtering Algorithms for Precedence and Dependency Constraints (en)
  • Inkrementální filtrační algoritmy pro precedenční a dependenční podmínky (cs)
skos:prefLabel
  • Incremental Filtering Algorithms for Precedence and Dependency Constraints
  • Incremental Filtering Algorithms for Precedence and Dependency Constraints (en)
  • Inkrementální filtrační algoritmy pro precedenční a dependenční podmínky (cs)
skos:notation
  • RIV/00216208:11320/08:00100356!RIV09-MSM-11320___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), P(GA201/07/0205), Z(MSM0021620838)
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
  • 371854
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/08:00100356
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Incremental; Filtering; Algorithms; Precedence; Dependency; Constraints (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • SG - Singapurská republika
http://linked.open...ontrolniKodProRIV
  • [78EEB4A1F1F0]
http://linked.open...i/riv/nazevZdroje
  • International Journal on Artificial Intelligence Tools
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
  • 17
http://linked.open...iv/tvurceVysledku
  • Barták, Roman
  • Čepek, Ondřej
http://linked.open...ain/vavai/riv/wos
  • 000253753000013
http://linked.open...n/vavai/riv/zamer
issn
  • 0218-2130
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software