Sciweavers

12659 search results - page 166 / 2532
» The distributed breakout algorithms
Sort
View
94
Voted
PPOPP
2012
ACM
13 years 5 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 16 days ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
TWC
2010
14 years 4 months ago
Splitting algorithms for fast relay selection: generalizations, analysis, and a unified view
Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting, considerable attention. While several criteria have be...
Virag Shah, Neelesh B. Mehta, Raymond Yim
WDAG
2007
Springer
127views Algorithms» more  WDAG 2007»
15 years 4 months ago
A Distributed Maximal Scheduler for Strong Fairness
Abstract. Weak fairness guarantees that if an action is continuously enabled, it is executed infinitely often. Strong fairness, on the other hand, guarantees that actions that are...
Matthew Lang, Paolo A. G. Sivilotti
ICWN
2004
14 years 11 months ago
A Distributed Clustering Framework in Mobile Ad Hoc Networks
Abstract-- In this paper, we present a completely distributed algorithm for partitioning a given set of mobile nodes into clusters. The proposed algorithm tries to reduce the amoun...
Mohit Garg, R. K. Shyamasundar