2084 search results - page 196 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
137
Voted
ATAL
2007
Springer
16 years 8 days ago
2007
Springer
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...
196
click to vote
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
123
Voted
ICDCS
2005
IEEE
15 years 11 months ago
2005
IEEE
We study how a server may disseminate a large volume of data to a set of clients in the shortest possible time. We first consider a cooperative scenario where clients are willing...
179
Voted
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
167
click to vote
WDAG
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...