arXiv (All)
open access
Nonpreemptive Scheduling While Learning Context-Dependent Service Rates
We study nonpreemptive contextual queueing bandits in a single-server system. Each job is represented by a $d$-dimensional context vector; in each round, a job may arrive with its context drawn from an unknown distribution $\mathcal{D}$, and its departure probability is determined by a logistic mode
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
- Reply to the Comment on "The Axiom of Choice and the No-Signalling Principle"#927617
- Dicey games: Shared sources of randomness in distributed systems#449044
- Bandits in Prod: Hyperparameter Optimization at Inference Time#924666
- Bandits in Prod: Hyperparameter Optimization at Inference Time#920432
- Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies#821391
Record · ID 1141973
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