Randomized online algorithms for maximizing busy time interval scheduling (Q1909593)

From MaRDI portal
Revision as of 05:07, 29 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Randomized online algorithms for maximizing busy time interval scheduling
scientific article

    Statements

    Randomized online algorithms for maximizing busy time interval scheduling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 March 1996
    0 references
    0 references
    busy time
    0 references
    probabilistic online algorithm
    0 references