Sciweavers

1536 search results - page 51 / 308
» Approximately Dominating Representatives
Sort
View
ENDM
2010
136views more  ENDM 2010»
13 years 10 months ago
Approximating the asymmetric profitable tour
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
Viet Hung Nguyen, Thi Thu Thuy Nguyen
EOR
2006
120views more  EOR 2006»
13 years 10 months ago
Approximate and exact algorithms for the fixed-charge knapsack problem
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
Umit Akinc
TODS
2002
92views more  TODS 2002»
13 years 9 months ago
Searching in metric spaces with user-defined and approximate distances
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
Paolo Ciaccia, Marco Patella
ICRA
2006
IEEE
136views Robotics» more  ICRA 2006»
14 years 4 months ago
Autonomous Capture of a Tumbling Satellite
— In this paper, we describe a framework for the autonomous capture and servicing of satellites. The work is based on laboratory experiments that illustrate the autonomy and remo...
Guy Rouleau, Ioannis M. Rekleitis, Régent L...
ICRA
2005
IEEE
123views Robotics» more  ICRA 2005»
14 years 3 months ago
SLAM via Variable Reduction from Constraint Maps
- The two dominant forms of SLAM are based on Extended Kalman Filtering and Consistent Pose Estimation. We show that these are particular subsets of a more general view of the SLAM...
Kurt Konolige