6437 search results - page 539 / 1288 » Parallel Algorithms for Arrangements |
201
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
187
click to vote
ICPP
2007
IEEE
16 years 1 months ago
2007
IEEE
— Most of existing search algorithms for unstructured peer-to-peer (P2P) systems share one common approach: the requesting node sends out a query and the query message is repeate...
162
click to vote
PODC
2005
ACM
16 years 12 days ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
192
click to vote
ICDCS
2010
IEEE
15 years 10 months ago
2010
IEEE
—This research focuses on distributed and localized algorithms for precise boundary detection in 3D wireless networks. Our objectives are in two folds. First, we aim to identify ...
206
click to vote
CLUSTER
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...