Sciweavers

4451 search results - page 10 / 891
» On Random Ordering Constraints
Sort
View
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
15 years 3 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan
AMC
2008
106views more  AMC 2008»
14 years 11 months ago
A non-binary constraint ordering heuristic for constraint satisfaction problems
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
Miguel A. Salido
CSCLP
2004
Springer
15 years 5 months ago
Dynamic Distributed BackJumping
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed ...
Viet Nguyen, Djamila Sam-Haroud, Boi Faltings
AMAI
2004
Springer
15 years 5 months ago
Combining Symmetry Breaking with Other Constraints: Lexicographic Ordering with Sums
Abstract. We introduce a new global constraint which combines together the lexicographic ordering constraint with two sum constraints. Lexicographic ordering constraints are freque...
Brahim Hnich, Zeynep Kiziltan, Toby Walsh
ICRA
2003
IEEE
159views Robotics» more  ICRA 2003»
15 years 5 months ago
Randomized manipulation planning for a multi-fingered hand by switching contact modes
Abstract— This paper presents a randomized manipulation planner for a multi-fingered hand by switching contact modes. Manipulation planning for such a system should consider cha...
Masahito Yashima, Yoshikazu Shiina, Hideya Yamaguc...