Sciweavers

942 search results - page 165 / 189
» Distance Constraint Satisfaction Problems
Sort
View
ICRA
2000
IEEE
86views Robotics» more  ICRA 2000»
14 years 2 months ago
Randomized Planning for Short Inspection Paths
This paper addresses the following inspection problem: given a known workspace and a robot with vision capabilities compute a short path path for the robot such that each point on...
Tim Danner, Lydia E. Kavraki
CVPR
2009
IEEE
15 years 5 months ago
Reconstructing Sharply Folding Surfaces: A Convex Formulation
In recent years, 3D deformable surface reconstruction from single images has attracted renewed interest. It has been shown that preventing the surface from either shrinking or s...
Mathieu Salzmann (University of California, Berkel...
ADHOCNOW
2008
Springer
13 years 11 months ago
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
Jean-Claude Bermond, Min-Li Yu
ATMOS
2007
119views Optimization» more  ATMOS 2007»
13 years 11 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte
AHSWN
2010
105views more  AHSWN 2010»
13 years 10 months ago
Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network,...
Jean-Claude Bermond, Min-Li Yu