295 search results - page 2 / 59 » A New Node Centroid Algorithm for Bandwidth Minimization |
IAT
2009
IEEE
15 years 4 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper, we study search algorithms for using a set of autonomous and cooperative mobile sensor nodes (MSN) with limited sensing and communication ranges to search a larg...
EDBT
2000
ACM
15 years 1 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
PPSN
2004
Springer
15 years 3 months ago
2004
Springer
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our ...
JGAA
2006
14 years 10 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...