Sciweavers

6542 search results - page 1171 / 1309
» The tao of parallelism in algorithms
Sort
View
DCOSS
2006
Springer
14 years 1 months ago
Lifetime Maximization of Sensor Networks Under Connectivity and k-Coverage Constraints
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...
Wei Mo, Daji Qiao, Zhengdao Wang
CCGRID
2001
IEEE
14 years 1 months ago
An Adaptive, Reconfigurable Interconnect for Computational Clusters
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...
Alexander V. Shafarenko, Vladimir Vasekin
HLPPP
1991
14 years 1 months ago
The Chemical Reaction Model
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...
Daniel Le Métayer
PODC
2010
ACM
14 years 4 days ago
On the computational power of oblivious robots: forming a series of geometric patterns
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 ...
Shantanu Das, Paola Flocchini, Nicola Santoro, Mas...
DAC
2008
ACM
13 years 12 months ago
Application mapping for chip multiprocessors
The problem attacked in this paper is one of automatically mapping an application onto a Network-on-Chip (NoC) based chip multiprocessor (CMP) architecture in a locality-aware fas...
Guangyu Chen, Feihui Li, Seung Woo Son, Mahmut T. ...
« Prev « First page 1171 / 1309 Last » Next »