189 search results - page 5 / 38 » Shortest Paths Without a Map |
132
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— In this paper, we evaluate a solution based on the preemption mechanism so as to improve performances of distributed Multi-Protocol Label Switching-Traffic Engineering (MPLS-T...
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper we study the Carnot-Caratheodory metrics on SU(2) S3 , SO(3) and SL(2) induced by their Cartan decomposition and by the Killing form. Besides computing explicitly...
125
click to vote
DATE
2006
IEEE
15 years 10 months ago
2006
IEEE
Network-on-Chip (NoC)-based communication represents a promising solution to complex on-chip communication problems. Due to their regular structure, mesh-like NoC architectures ha...
144
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
163
click to vote
W2GIS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...