6437 search results - page 1151 / 1288 » Parallel Algorithms for Arrangements |
123
click to vote
DCOSS
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
131
Voted
DCOSS
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
106
click to vote
CCGRID
2001
IEEE
15 years 4 months ago
2001
IEEE
This paper describes the principles of an original adaptive interconnect for a computational cluster. Torus topology (2d or 3d) is used as a basis but nodes are allowed to effecti...
99
Voted
HLPPP
1991
15 years 4 months ago
1991
Gamma was originally proposed in 1986 as a formalism for the de nition of programs without arti cial sequentiality. The basic idea underlying the formalism is to describe computati...
94
Voted
PODC
2010
ACM
15 years 2 months ago
2010
ACM
We study the computational power of a distributed system consisting of simple autonomous robots moving on the plane. The robots are endowed with visual perception but do not have ...