460 search results - page 29 / 92 » Bounding the locality of distributed routing algorithms |
CCGRID
2005
IEEE
14 years 2 months ago
2005
IEEE
— The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates management...
TMC
2008
13 years 8 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
AAAI
2006
13 years 10 months ago
2006
Learning application-specific distance metrics from labeled data is critical for both statistical classification and information retrieval. Most of the earlier work in this area h...
IPCCC
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
ADHOCNOW
2008
Springer
14 years 3 months ago
2008
Springer
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...