2924 search results - page 194 / 585 » Lower Bounds in Distributed Computing |
141
click to vote
NAS
2010
IEEE
15 years 1 months ago
2010
IEEE
In many practical applications of wireless sensor networks, it is crucial to accomplish the localization of sensors within a given time bound. We find that the traditional defin...
134
click to vote
MST
2010
15 years 1 months ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
113
Voted
WIOPT
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— We investigate two quantities of fundamental interest in a mobile ad-hoc network: the capacity region and the minimum energy function of the network. The capacity regio...
113
click to vote
SIGECOM
2005
ACM
15 years 8 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
141
click to vote
MOBIHOC
2012
ACM
13 years 5 months ago
2012
ACM
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...