2924 search results - page 444 / 585 » Lower Bounds in Distributed Computing |
139
click to vote
NIPS
2007
15 years 6 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
147
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
151
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...
120
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
126
click to vote
ICS
1999
Tsinghua U.
15 years 9 months ago
1999
Tsinghua U.
This paper presents an investigation into local mechanisms and scheduling policies that allow guest processes to efficiently exploit otherwise-idle workstation resources. Unlike t...