Dynamic TCP acknowledgment and other stories about \(e/(e-1)\)
From MaRDI portal
Publication:1400893
DOI10.1007/s00453-003-1013-xzbMath1045.68155OpenAlexW2031816824MaRDI QIDQ1400893
Dana Randall, Anna R. Karlin, Claire M. Kenyon
Publication date: 17 August 2003
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-003-1013-x
Related Items
Machine learning advised ski rental problem with a discount ⋮ On the remote server problem or more about TCP acknowledgments ⋮ Caching with Time Windows and Delays ⋮ Non-linear ski rental ⋮ Competitive analysis of organization networks or multicast acknowledgment: how much to wait? ⋮ Competitive analysis for online leasing problem with compound interest rate ⋮ Online Algorithms for Multilevel Aggregation ⋮ On bin packing with clustering and bin packing with delays ⋮ Price Fluctuations: To Buy or to Rent ⋮ New results on multi-level aggregation ⋮ Ski rental with two general options ⋮ Unnamed Item ⋮ Dynamic TCP acknowledgment with sliding window ⋮ Parameter learning algorithm for the online data acknowledgment problem ⋮ Machine learning advised algorithms for the ski rental problem with a discount ⋮ Non-additive two-option ski rental ⋮ Rent or buy problems with a fixed time horizon ⋮ Non-Additive Two-Option Ski Rental
