390 search results - page 10 / 78 » Computing shortest paths for any number of hops |
IPL
2008
14 years 11 months ago
2008
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
138
click to vote
CVPR
2011
IEEE
14 years 9 months ago
2011
IEEE
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
IFIPTCS
2010
14 years 9 months ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
106
click to vote
ICDCS
2012
IEEE
13 years 2 months ago
2012
IEEE
—Quickly recovering IP networks from failures is critical to enhancing Internet robustness and availability. Due to their serious impact on network routing, large-scale failures ...
VTC
2010
IEEE
14 years 10 months ago
2010
IEEE
—In this paper, we introduce a collision model for vehicular cluster and we propose path selection algorithms for multi-hop VANETs. That is, we propose the intuitive algorithm na...