Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty (Q2321284): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q128455346, #quickstatements; #temporary_batch_1723807531120
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2018.11.008 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Incorporating decision nodes into conditional simple temporal networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional simple temporal networks with uncertainty and decisions / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2018.11.008 / rank
 
Normal rank

Latest revision as of 00:09, 18 December 2024

scientific article
Language Label Description Also known as
English
Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty
scientific article

    Statements

    Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty (English)
    0 references
    0 references
    0 references
    28 August 2019
    0 references
    temporal planning
    0 references
    temporal uncertainty
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references