390 search results - page 52 / 78 » Computing shortest paths for any number of hops |
122
click to vote
DCOSS
2009
Springer
15 years 8 months ago
2009
Springer
Wireless sensor networks (WSNs) have recently gained a great deal of attention as a topic of research, with a wide range of applications being explored. Bulk data dissemination is ...
IJCAI
1993
15 years 3 months ago
1993
In this paper a framework is developed for measuring the complexities of deductions in an ab stract and computationally perspicuous man ner. As a notion of central importance ...
114
click to vote
WIOPT
2010
IEEE
15 years 8 days ago
2010
IEEE
—In this paper we study the influence of using hub nodes to relay messages in human-based delay tolerant networks (DTNs), by analyzing empirical traces obtained by human mobilit...
EDCC
2008
Springer
15 years 3 months ago
2008
Springer
We present the design, correctness, and analysis of SONDe, a simple fully decentralized object deployment algorithm for highly requested systems. Given an object (service or data)...
FOCS
1998
IEEE
15 years 6 months ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...