2084 search results - page 194 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
127
Voted
ESA
2006
Springer
15 years 6 months ago
2006
Springer
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
129
Voted
SIGMETRICS
2003
ACM
15 years 7 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
108
click to vote
AAAI
1996
15 years 3 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
94
Voted
DRM
2007
Springer
15 years 8 months ago
2007
Springer
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
127
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
In this paper we address the problem of selfish behavior in ad hoc networks. We propose a strategy driven approach which aims at enforcing cooperation between network participant...