Automated competitive analysis of real-time scheduling with graph games (Q1698779)

From MaRDI portal
Revision as of 04:41, 15 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Automated competitive analysis of real-time scheduling with graph games
scientific article

    Statements

    title
    Automated competitive analysis of real-time scheduling with graph games (English)
    0 references
    author
    Krishnendu Chatterjee
    0 references
    Andreas Pavlogiannis
    0 references
    Alexander Kößler
    0 references
    Ulrich Schmid
    0 references
    publication date
    16 February 2018
    0 references
    Mathematics Subject Classification ID
    68M20
    0 references
    68Q17
    0 references
    90B35
    0 references
    91A43
    0 references
    zbMATH DE Number
    6839890
    0 references
    zbMATH Keywords
    real-time scheduling
    0 references
    firm-deadline tasks
    0 references
    competitive analysis
    0 references
    quantitative graph games
    0 references
    describes a project that uses
    lp_solve
    0 references
    lpSolve
    0 references
    OpenAlex ID
    W2766431763
    0 references
    cites work
    Q4223058
    0 references
    Q2934599
    0 references
    Q3050157
    0 references
    Borel determinacy
    0 references
    Q3221403
    0 references
    Stochastic Games
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1698779&oldid=36373113"
    Powered by MediaWiki