arXiv (All)
open access
Improved Analysis of Adaptive Task Allocation and Non-Stationary Processing Times
We study the task allocation problem, where our goal is to develop an online algorithm that efficiently distributes tasks among workers based on their computational performance. This task is challenging since computation times are random and non-stationary in practice. Recent works have introduced d
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
- Online Job Assignment#1342326
- Group Decision-Making in Computer-Supported Cooperative Work Environments#212547
- Dynamic Content Caching with Waiting Costs via Restless Multi-Armed Bandits#1064865
- Lag: A Mean-Field Optimal Policy for Online Assignment with Reusable Resources#1344861
- The $k$-server conjecture is true#1110002
Record · ID 1343780
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