1051 search results - page 114 / 211 » Foundations of Constraint Satisfaction |
149
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...
163
click to vote
KI
1999
Springer
15 years 10 months ago
1999
Springer
Among the formalisms for qualitative spatial reasoning, the Region Connection Calculus and its variant, the constraint algebra RCC8, have received particular attention recently. A...
163
click to vote
FOCS
2007
IEEE
16 years 15 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 10 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
Voted
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 ...