251 search results - page 15 / 51 » Distributed algorithms for edge dominating sets |
HIPC
2000
Springer
15 years 1 months ago
2000
Springer
In this paper, we propose a distributed clustering algorithm for a multi-hop packet radio network. These types of networks, also known as ad hoc networks, are dynamic in nature due...
ALGORITHMICA
2006
14 years 9 months ago
2006
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
SSS
2009
Springer
15 years 4 months ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
CJ
1999
14 years 9 months ago
1999
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...
101
click to vote
ESA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...