Sciweavers

557 search results - page 68 / 112
» On the convergence time of distributed quantized averaging a...
Sort
View
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
14 years 8 months ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala
ATAL
2010
Springer
13 years 8 months ago
A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
Ruben Stranders, Alex Rogers, Nicholas R. Jennings
ADHOCNOW
2008
Springer
14 years 2 months ago
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
Luminita Moraru, Pierre Leone, Sotiris E. Nikolets...
IPPS
2005
IEEE
14 years 1 months ago
Security-Driven Heuristics and A Fast Genetic Algorithm for Trusted Grid Job Scheduling
In this paper, our contributions are two-fold: First, we enhance the Min-Min and Sufferage heuristics under three risk modes driven by security concerns. Second, we propose a new ...
Shanshan Song, Yu-Kwong Kwok, Kai Hwang
IPPS
2005
IEEE
14 years 1 months ago
Improving and Stabilizing Parallel Computer Performance Using Adaptive Backfilling
The scheduler is a key component in determining the overall performance of a parallel computer, and as we show here, the schedulers in wide use today exhibit large unexplained gap...
David Talby, Dror G. Feitelson