Sciweavers

763 search results - page 57 / 153
» Engineering Shortest Path Algorithms
Sort
View
JCT
1998
99views more  JCT 1998»
13 years 8 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
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...
Shuhong Gao, Beth Novick, Ke Qiu
ICRA
2003
IEEE
120views Robotics» more  ICRA 2003»
14 years 2 months ago
Extracting optimal paths from roadmaps for motion planning
We present methods for extracting optimal paths from motion planning roadmaps. Our system enables any combination of optimization criteria, such as collision detection, kinematic/...
Jinsuck Kim, Roger A. Pearce, Nancy M. Amato
INFOCOM
2003
IEEE
14 years 2 months ago
Algorithms for Computing QoS Paths with Restoration
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
Yigal Bejerano, Yuri Breitbart, Rajeev Rastogi, Al...
AROBOTS
2005
100views more  AROBOTS 2005»
13 years 8 months ago
A Sampling-Based Motion Planning Approach to Maintain Visibility of Unpredictable Targets
This paper deals with the surveillance problem of computing the motions of one or more robot observers in order to maintain visibility of one or several moving targets. The target...
Rafael Murrieta-Cid, Benjamín Tovar, Seth H...
INFOCOM
2000
IEEE
14 years 16 days ago
Traffic Engineering Using Multiple Multipoint-to-Point LSPs
Traffic engineering aims to optimize the utilization of existing network resources for load balance and failure recovery, and these are to be accomplished in a scalable fashion. Th...
Hiroyuki Saito, Yasuhiro Miyao, Makiko Yoshida