425 search results - page 70 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Energy consumption is the most important factor that determines sensor node lifetime. The optimization of wireless sensor network lifetime targets not only the reduction of energy...
EUROPAR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper presents new techniques for master-slave tasking on treeshaped networks with fully heterogeneous communication and processing resources. A large number of inde...
CN
2010
13 years 7 months ago
2010
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
SIGMOD
2010
ACM
13 years 11 months ago
2010
ACM
A database application differs form regular applications in that some of its inputs may be database queries. The program will execute the queries on a database and may use any re...