858 search results - page 110 / 172 » A Glimpse of Constraint Satisfaction |
132
click to vote
CP
2003
Springer
15 years 11 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...
148
click to vote
IDEAL
2003
Springer
15 years 11 months ago
2003
Springer
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...
162
Voted
FOCS
2007
IEEE
16 years 14 days ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
143
click to vote
CPAIOR
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
124
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...