2084 search results - page 213 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
82
Voted
CORR
2006
Springer
14 years 10 months ago
2006
Springer
The concept of distributed transmit beamforming is implicit in many key results of network information theory. However, its implementation in a wireless network involves the funda...
97
Voted
IEEECIT
2005
IEEE
15 years 3 months ago
2005
IEEE
We report on a case study in which SAL model checkers have been used to analyze the Suzuki-Kasami distributed mutual exclusion algorithm with respect to the mutual exclusion prope...
IPCCC
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
81
Voted
ACL
2011
14 years 1 months ago
2011
This paper presents an attempt at building a large scale distributed composite language model that simultaneously accounts for local word lexical information, mid-range sentence s...
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...