3678 search results - page 99 / 736 » On the Stable Paths Problem |
100
click to vote
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
88
Voted
IROS
2008
IEEE
15 years 7 months ago
2008
IEEE
— A series of kinodynamic sampling-based planners have appeared over the last decade to deal with high dimensional problems for robots with realistic motion constraints. Yet, of...
DIAGRAMS
2006
Springer
15 years 4 months ago
2006
Springer
We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...
72
Voted
WEA
2005
Springer
15 years 6 months ago
2005
Springer
Recent techniques for inferring business relationships between ASs [3, 8] have yielded maps that have extremely few invalid BGP paths in the terminology of Gao [9]. However, some ...
84
Voted
WADS
1995
Springer
15 years 4 months ago
1995
Springer
We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and non–zero propaga...