137 search results - page 26 / 28 » Optimising Node Coordinates for the Shortest Path Problem |
INFOCOM
2011
IEEE
12 years 10 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...
USS
2004
13 years 8 months ago
2004
We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding per...
AI
2011
Springer
13 years 2 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract—In this paper, we investigate the fundamental properties of broadcasting in mobile wireless networks. In particular, we characterize broadcast capacity and latency of a ...
PR
2007
13 years 6 months ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...