The main contribution of this paper is new randomized online algorithm for TC P acknowledge- ment that achieves the best possible competitive ratio of e/(e - 1 ...
Dynamic TCP Acknowledgment and Other Stories about e/(e - 1). We present the first optimal randomized online algorithms for the TCP acknowledgment problem [3] ...
ABSTRACT. We present the first optimal randomized online algorithms for the TCP acknowledgment problem [5] and the Bahncard problem [7].
We present the first optimal randomized online algorithms for the TCP acknowledgment problem [3] and the Bahncard problem [5]. These problems are well know.
Missing: acknowledgement | Show results with:acknowledgement
In this paper we demonstrate that a number of online algorithms which have optimal competitive ratios of e/(e-1) , including these, are fundamentally no more ...
We present the first optimal randomized online algorithms for the TCP acknowledgment problem [3] and the Bahncard problem [5]. These problems are well known ...
Missing: acknowledgement | Show results with:acknowledgement
In this paper, we demonstrate that a number of online algorithms which have optimal competitive ratios of e/(e-1), including these, are fundamentally no more ...
People also ask
What are the types of acknowledgement in TCP?
What is the acknowledgement system of TCP?
Nov 6, 2018 · Anna R. Karlin, Claire Kenyon, Dana Randall: Dynamic TCP acknowledgement and other stories about e/(e-1). STOC 2001: 502-509.
In this paper we demonstrate that a number of online algorithms which have optimal competitive ratios of e/(e‐1) , including these, are fundamentally no more ...
Missing: acknowledgement | Show results with:acknowledgement
Dynamic TCP acknowledgement and other stories about e/(e−1). Proceedings of the 33th Annual ACM Symposium on Theory of Computing, ACM Press (2001), pp. 502 ...