2084 search results - page 265 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
105
Voted
STOC
2005
ACM
15 years 8 months ago
2005
ACM
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
JSC
2006
15 years 2 months ago
2006
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if...
116
click to vote
ISCC
2003
IEEE
15 years 7 months ago
2003
IEEE
The paper presents the performance advantage of Wireless Token Ring Protocol (WTRP) versus IEEE 802.11 in DCF mode. WTRP is a medium access control (MAC) protocol and is designed ...
117
Voted
PE
2008
Springer
15 years 2 months ago
2008
Springer
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
142
click to vote
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— High-throughput P2P streaming relies on peer selection, the strategy a peer uses to select other peer(s) as its parent(s) of streaming. Although this problem has been t...