2084 search results - page 106 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
92
Voted
WDAG
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model t...
149
Voted
DBPL
2007
Springer
15 years 6 months ago
2007
Springer
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
91
Voted
SODA
2001
ACM
15 years 4 months ago
2001
ACM
Most information-retrieval systems preprocess the data to produce an auxiliary index structure. Empirically, it has been observed that there is a tradeoff between query response t...
140
click to vote
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
117
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper deals with the self-stabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm ...