Threshold algorithms decide when to accept a request without knowing what comes next

Popularity Index: 2 Updated at 2026-10-11 09:24 UTC

Sites

Related Topics

List update has provable competitive ratios that real browsers do not implement Caching web content is an online algorithm problem long before it is a hardware problem Competitive ratio is how an online algorithm is judged since the future is unknown LRU degrades badly on looping access patterns that FIFO handles better Belady's optimal replacement algorithm cannot exist in practice because it needs future requests The ski rental problem models paying per use versus buying outright Random eviction beats strict LRU in some CDN cache configurations The k-server problem has stayed open for decades despite constant competitive ratio improvements People use dark mode for battery savings that only matter on OLED screens Modern chips are small enough that most home routers could not be built twenty years ago

Hot Categories

Featured Categories