Sciweavers

942 search results - page 95 / 189
» Distance Constraint Satisfaction Problems
Sort
View
PUK
2001
14 years 11 months ago
Realizing a Global Hyperpolyhedron Constraint via LP Techniques
Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...
Miguel A. Salido, Adriana Giret, Federico Barber
AUSAI
2008
Springer
15 years 3 days ago
Constraint-Based Multi-agent Path Planning
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
Malcolm Ryan
APJOR
2010
131views more  APJOR 2010»
14 years 10 months ago
Metric-Preserving Reduction of Earth Mover's Distance
Earth mover's distance (EMD for short) is a perceptually meaningful dissimilarity measure between histograms. The computation of EMD reduces to a network flow optimization pro...
Yuichi Takano, Yoshitsugu Yamamoto
67
Voted
ICRA
2005
IEEE
123views Robotics» more  ICRA 2005»
15 years 3 months ago
Stable Pushing of Assemblies
— This paper presents a method to determine whether an assembly of planar parts will stay assembled as it is pushed over a support surface. For a given pushing motion, an assembl...
Jay Bernheisel, Kevin M. Lynch
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
15 years 10 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon