Sciweavers

1576 search results - page 227 / 316
» Properties of Synthetic Optimization Problems
Sort
View
WADS
1997
Springer
91views Algorithms» more  WADS 1997»
14 years 2 months ago
Dynamic Motion Planning in Low Obstacle Density Environments
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
Robert-Paul Berretty, Mark H. Overmars, A. Frank v...
FLAIRS
2003
13 years 11 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
COR
2007
106views more  COR 2007»
13 years 10 months ago
Scheduling parallel CNC machines with time/cost trade-off considerations
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
Sinan Gurel, M. Selim Akturk
IVC
2007
114views more  IVC 2007»
13 years 10 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
IJCV
2000
223views more  IJCV 2000»
13 years 10 months ago
The Earth Mover's Distance as a Metric for Image Retrieval
We investigate the properties of a metric between two distributions, the Earth Mover's Distance (EMD), for content-based image retrieval. The EMD is based on the minimal cost ...
Yossi Rubner, Carlo Tomasi, Leonidas J. Guibas