58 search results - page 1 / 12 » Constrainedness and Redundancy by Constraint Ordering |
IBERAMIA
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
AMC
2008
13 years 5 months ago
2008
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 ...
ICRA
2009
IEEE
13 years 3 months ago
2009
IEEE
We present a novel method for prioritizing both linear equality and inequality systems and provide one algorithm for its resolution. This algorithm can be summarized as a sequence ...
CP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
AAAI
1997
13 years 6 months ago
1997
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...