866 search results - page 55 / 174 » On Dynamic Shortest Paths Problems |
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— We study optimal trajectory generation for nonholonomic mobile robots in the presence of moving obstacles. The trajectory is presented by a parameterized higher-order p...
SENSYS
2003
ACM
14 years 27 days ago
2003
ACM
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
13 years 7 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
JCT
1998
13 years 7 months ago
1998
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
ICMCS
2007
IEEE
14 years 1 months ago
2007
IEEE
Due to the increase in diversity of wireless devices, streaming media systems must be capable of serving multiple types of users. Scalable coding allows for adaptations without re...