2084 search results - page 196 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
98
Voted
ATAL
2007
Springer
15 years 8 months 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...
148
Voted
ECCV
2008
Springer
16 years 26 days 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 ...
88
Voted
ICDCS
2005
IEEE
15 years 8 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...
131
Voted
MOBIHOC
2008
ACM
16 years 2 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...
126
Voted
WDAG
2007
Springer
15 years 8 months 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 ...