422 search results - page 39 / 85 » Shortest paths between shortest paths and independent sets |
ICRA
2008
IEEE
14 years 3 months ago
2008
IEEE
— What is the shortest or fastest path a mobile robot can follow between two configurations in the unobstructed plane? The answer to this fundamental question is only known anal...
CORR
2002
Springer
13 years 8 months ago
2002
Springer
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of pat...
GLOBECOM
2009
IEEE
13 years 6 months ago
2009
IEEE
Abstract--We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all ...
SIGECOM
2003
ACM
14 years 1 months ago
2003
ACM
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...
COLOGNETWENTE
2008
13 years 10 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...