New algorithms for online packet scheduling with deadlines and partial feedback achieve Õ(√(KT)) α-regret and break the golden-ratio competitive ratio barrier for finite packet types.
Learning-augmented online packet scheduling with deadlines
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A new algorithm for preemptive FIFO buffer management achieves 1-consistency, η-smoothness, and asymptotic √3-robustness using an output-based prediction error metric and buffer-clearing fallback.
citing papers explorer
-
Online Packet Scheduling with Deadlines and Learning
New algorithms for online packet scheduling with deadlines and partial feedback achieve Õ(√(KT)) α-regret and break the golden-ratio competitive ratio barrier for finite packet types.
-
Asymptotically Robust Learning-Augmented Algorithms for Preemptive FIFO Buffer Management
A new algorithm for preemptive FIFO buffer management achieves 1-consistency, η-smoothness, and asymptotic √3-robustness using an output-based prediction error metric and buffer-clearing fallback.