2084 search results - page 97 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
233
click to vote
DCOSS
2011
Springer
14 years 4 months ago
2011
Springer
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...
131
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
138
click to vote
STOC
2010
ACM
16 years 2 months ago
2010
ACM
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
150
click to vote
PPSN
2010
Springer
15 years 3 months ago
2010
Springer
The hypervolume indicator is widely used to guide the search and to evaluate the performance of evolutionary multi-objective optimization algorithms. It measures the volume of the ...
129
Voted
COCOON
2001
Springer
15 years 9 months ago
2001
Springer
We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item ...