Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games (Q1706770): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10601-016-9243-0 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: PGSolver / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HyTN / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10601-016-9243-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2169859441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: USING STRATEGY IMPROVEMENT TO STAY ALIVE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for mean-payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5435011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From local to global consistency in temporal constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverability of Communication Protocols--Implications of a Theoretical Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal representation and reasoning in artificial intelligence: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Strategy Improvement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtracking algorithms for disjunctions of temporal constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: CTP: A new constraint-based formalism for conditional, temporal planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handling contingency in temporal constraint networks: from consistency to controllabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10601-016-9243-0 / rank
 
Normal rank

Latest revision as of 05:11, 11 December 2024

scientific article
Language Label Description Also known as
English
Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games
scientific article

    Statements

    Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 March 2018
    0 references
    simple temporal networks
    0 references
    temporal consistency
    0 references
    hypergraphs
    0 references
    pseudo-polynomial time algorithms
    0 references
    mean payoff games
    0 references
    disjunctive temporal problems
    0 references
    workflows
    0 references
    0 references
    0 references
    0 references

    Identifiers