858 search results - page 13 / 172 » A Glimpse of Constraint Satisfaction |
120
Voted
MICAI
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be...
153
Voted
ICTAI
2009
IEEE
14 years 11 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
124
click to vote
KBSE
1997
IEEE
15 years 5 months ago
1997
IEEE
This paper discusses our approach to the problem of refining high-level simulation specifications. Our domain is simulated combat training for tank platoon members. Our input is a...
135
Voted
FOCS
2008
IEEE
15 years 2 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
130
click to vote
JACM
2010
15 years 9 days ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...