On Time Lookahead Algorithms for the Online Data Acknowledgement Problem
From MaRDI portal
Publication:3525577
DOI10.1007/978-3-540-74456-6_27zbMath1147.68883OpenAlexW1511645436MaRDI QIDQ3525577
Publication date: 17 September 2008
Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_27
Related Items (3)
A new model for the linear 1-dimensional online clustering problem ⋮ Exact distributional analysis of online algorithms with lookahead ⋮ Parameter learning algorithm for the online data acknowledgment problem
This page was built for publication: On Time Lookahead Algorithms for the Online Data Acknowledgement Problem