2084 search results - page 303 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
TWC
2010
14 years 4 months ago
2010
Abstract--We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time with respect ...
110
click to vote
MST
2002
14 years 9 months ago
2002
Abstract. In this paper we consider communication issues arising in cellular (mobile) networks that utilize frequency division multiplexing (FDM) technology. In such networks, many...
IPPS
2008
IEEE
15 years 4 months ago
2008
IEEE
Gossip-based Peer-to-Peer(P2P) streaming has been proved to be an effective and resilient method to stream qualified media contents in dynamic and heterogeneous network environme...
ISORC
2000
IEEE
15 years 2 months ago
2000
IEEE
There have been many debates about the feasibility of providing guaranteed Quality of Service (QoS) when network traffic travels beyond the enterprise domain and into the vast unk...