410 search results - page 31 / 82 » Upgrading Shortest Paths in Networks |
106
click to vote
ISCC
2005
IEEE
15 years 7 months ago
2005
IEEE
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
115
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
What does a typical road network look like? Existing generative models tend to focus on one aspect to the exclusion of others. We introduce the general-purpose quadtree model and ...
121
click to vote
LCN
2003
IEEE
15 years 6 months ago
2003
IEEE
We consider wireless multicast tree construction for energy efficiency. We introduce a novel algorithm, Incremental Shortest Path Tree (ISPT), to generate source-based multicast ...
107
click to vote
JAIR
2002
15 years 1 months ago
2002
We consider the problem of designing the the utility functions of the utility-maximizing agents in a multi-agent system (MAS) so that they work synergistically to maximize a globa...
AINA
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we propose a map matching algorithm for car navigation systems that predict user destination. This car navigation system is a novel system that automatically predict...