2084 search results - page 296 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
SPAA
1995
ACM
15 years 1 months ago
1995
ACM
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
IWCMC
2009
ACM
15 years 4 months ago
2009
ACM
For a point-to-point multi-input multi-output (MIMO) wireless channel, we propose a feedback scheme, which consists of transmit-antenna selection algorithm and beamforming quantiz...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
— Opportunistic routing is proposed to improve the performance of wireless networks by exploiting the broadcast nature and spatial diversity of the wireless medium. In this paper...
ICDCS
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper presents a new method to control the delay performance for high rate heterogeneous real-time traffic flows based on a novel traffic control algorithm which is a gene...