arXiv (All)
open access
Dynamic Content Caching with Waiting Costs via Restless Multi-Armed Bandits
We consider a system with a local cache connected to a backend server and an end user population. A set of contents are stored at the the server where they continuously get updated. The local cache keeps copies, potentially stale, of a subset of the contents. The users make content requests to the l
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Lipschitz Bandits with Arbitrary Feedback Delays#612467
- Lipschitz Bandits with Arbitrary Feedback Delays#610990
- PASCAL: A Phase-Aware Shared-Cache Model for Parallel Scans#997387
- Queues: Theory and Applications#66873
- Fathom: Per-Query Read Depth for Sparse Decoding over Offloaded KV Caches#1035613
Record · ID 1064865
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive