Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary

arXiv:2302.00985 · cs.DS, cs.LG · Submitted 2023-02-02 · Read on arXiv

cs.DS, cs.LG

Submitted: 2023-02-02

Updated: 2026-10-12

Project page: https://algorithms-with-predictions.github.io

Terminology

• Core — 1× in this paper · explained in 2 episodes
• Theoretical Guarantees — 1× in this paper · explained in 2 episodes

Sources

• Scheduling with Speed Predictions

Related papers

• Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
• Computational and Statistical Hardness of Calibration Distance
• Edge-Private Matching Kernels Through Local Decoding
• Tight Bounds for Equivalence Testing with Non-Adaptive Conditional Samples
• Local Node Differential Privacy
• Cheaper by the Batch: Shared Traversal for Genotype Graph Editing