Sciweavers

3678 search results - page 71 / 736
» On the Stable Paths Problem
Sort
View
94
Voted
CCCG
2003
15 years 2 months ago
Shortest Paths in Two Intersecting Pencils of Lines
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the a...
David Hart
113
Voted
FOCS
2009
IEEE
15 years 7 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
65
Voted
ICRA
2009
IEEE
106views Robotics» more  ICRA 2009»
15 years 7 months ago
On-line time-optimal path tracking for robots
— This paper focuses on time-optimal path tracking, which involves planning of robot motions along prescribed geometric paths. Starting from a discretized convex reformulation of...
Diederik Verscheure, Moritz Diehl, Joris De Schutt...
109
Voted
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
14 years 11 months ago
Planning short paths with clearance using explicit corridors
— A central problem of applications dealing with virtual environments is planning a collision-free path for a character. Since environments and their characters are growing more ...
Roland Geraerts
118
Voted
ICC
2007
IEEE
162views Communications» more  ICC 2007»
15 years 4 months ago
LSP and Back Up Path Setup in MPLS Networks Based on Path Criticality Index
This paper reports on a promising approach for solving problems found when Multi Protocol Label Switching (MPLS), soon to be a dominant protocol, is used in core network systems. D...
Ali Tizghadam, Alberto Leon-Garcia