An adversarial model for scheduling with testing (Q2211361): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Submodular Stochastic Probing on Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: When LP is the cure for your matching woes: improved bounds for stochastic matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the adaptivity gap of stochastic orienteering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Matching with Few Queries: New Algorithms and Tools / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Matches Made in Heaven / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Playing Golf with Two Balls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4993294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing shortest paths with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Median with Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hamilton cycles in random graphs with few queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths in sparse random graphs requires many queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4580177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi‐Armed Bandit Allocation Indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust knapsack problem with queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Markovian price of information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Running Errands in Time: Approximation Algorithms for Stochastic Orienteering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stochastic Probing Problem with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Adaptivity Gaps for Stochastic Probing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The update complexity of selection and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Risk-averse single machine scheduling: complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning in Stochastic Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomization Helps Computing a Minimum Spanning Tree under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and Algorithms for Stochastic Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight 2-Approximation for Preemptive Stochastic Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic scheduling problems I — General strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation in stochastic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of maintenance models: The control and surveillance of deteriorating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search for the Best Alternative / rank
 
Normal rank

Latest revision as of 01:28, 24 July 2024

scientific article
Language Label Description Also known as
English
An adversarial model for scheduling with testing
scientific article

    Statements

    An adversarial model for scheduling with testing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 November 2020
    0 references
    0 references
    explorable uncertainty
    0 references
    competitive analysis
    0 references
    lower bounds
    0 references
    scheduling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references