6105 search results - page 1102 / 1221 » A Parallel Algorithm for Bound-Smoothing |
121
Voted
DCOSS
2006
Springer
15 years 8 months ago
2006
Springer
In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms o...
154
Voted
DCOSS
2006
Springer
15 years 8 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...
172
Voted
DCOSS
2006
Springer
15 years 8 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...
141
click to vote
CCGRID
2001
IEEE
15 years 8 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...
130
click to vote
HLPPP
1991
15 years 8 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...