About: Temporal Networks with Alternatives: Complexity and Model     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 popisuje rozšíření temporálních sítí o možnost paralelních a alternativních větvení a ukazuje, že problém zjištění validity uzlů je zde NP-úplný. (cs)
  • Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose an extension of temporal networks by parallel and alternative branching. This extension supports modelling of alternative paths in the network; in particular, it is motivated by modelling alternative process routes in manufacturing scheduling. We show that deciding which nodes can be consistently included in this extended temporal network is an NP-complete problem. The ideas are presented using precedence networks, but we also show how they can be extended to simple temporal networks.
  • Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose an extension of temporal networks by parallel and alternative branching. This extension supports modelling of alternative paths in the network; in particular, it is motivated by modelling alternative process routes in manufacturing scheduling. We show that deciding which nodes can be consistently included in this extended temporal network is an NP-complete problem. The ideas are presented using precedence networks, but we also show how they can be extended to simple temporal networks. (en)
Title
  • Temporal Networks with Alternatives: Complexity and Model
  • Temporal Networks with Alternatives: Complexity and Model (en)
  • Temporální sítě s alternativami: složitost a model (cs)
skos:prefLabel
  • Temporal Networks with Alternatives: Complexity and Model
  • Temporal Networks with Alternatives: Complexity and Model (en)
  • Temporální sítě s alternativami: složitost a model (cs)
skos:notation
  • RIV/00216208:11320/07:00004510!RIV08-MSM-11320___
http://linked.open.../vavai/riv/strany
  • 641;646
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0545), P(GA201/07/0205), Z(MSM0021620838)
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
  • 454520
http://linked.open...ai/riv/idVysledku
  • RIV/00216208:11320/07:00004510
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Temporal; Networks; Alternatives; Complexity; Model (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [1DA2DA51B6BE]
http://linked.open...v/mistoKonaniAkce
  • Menlo Park
http://linked.open...i/riv/mistoVydani
  • Menlo Park
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the Twentieth International Florida AI Research Society Conference (FLAIRS 2007)
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...iv/tvurceVysledku
  • Barták, Roman
  • Čepek, Ondřej
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • AAAI Press
https://schema.org/isbn
  • 978-1-57735-319-5
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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software