390 search results - page 68 / 78 » Computing shortest paths for any number of hops |
114
click to vote
ICRA
2002
IEEE
15 years 4 months ago
2002
IEEE
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
101
click to vote
CW
2008
IEEE
15 years 6 months ago
2008
IEEE
Traveling through immersive virtual environments (IVEs) by means of real walking is an important activity to increase naturalness of VR-based interaction. However, the size of the...
116
click to vote
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
COMCOM
2004
14 years 11 months ago
2004
Routing of packets in mobile ad hoc networks with a large number of nodes or with high mobility is a very difficult task and current routing protocols do not really scale well wit...
STACS
2009
Springer
15 years 6 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...