arXiv (All)
open access
Asymptotic optimality of dynamic first-fit packing on the half-axis
We revisit a classical problem in dynamic storage allocation. Items arrive in a linear storage medium, modeled as a half-axis, at a Poisson rate $r$ and depart after an independent exponentially distributed unit mean service time. The arriving item sizes (lengths) are assumed to be independent and i
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
- Latency-Optimal Geo-Distributed Storage over Structured Networks#972168
- Zipf’s law, Heaps’ law, and beyond#68978
- Analysis of energy and exergy of a thermal storage system using multiple phase change material#940549
- Generation time in a discrete epidemic model with asymptomatic carriers: beyond geometric waiting times#987638
- Asymmetric Consumer Learning and Inventory Competition#941633
Record · ID 1075957
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