← Back to contracts

AF: Small: Towards New Relaxations for Online Algorithms

US NSF grant open #nsf-2608359

Summary

We all are regularly asked to make decisions in the face of uncertainty: we decide how best to drive to work or how and at what prices to buy and sell things (everything from houses to groceries). And our computers make such choices as well to give good performance to their users: which order to process tasks q to maximize the throughput or minimize user delay, or which pages to keep in fast memory (because they will be accessed again soon) and which others moved to slower memory. These questions do not fall in the classical ``one-shot'' framework of computation, where an algorithm reads in th

AF: Small: Towards New Relaxations for Onl…
Onboard