1381 search results - page 30 / 277 » Computational Complexity of Constraint Satisfaction |
122
Voted
FOCS
2007
IEEE
15 years 10 months 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 ...
111
Voted
APPROX
2005
Springer
15 years 9 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
127
click to vote
FLAIRS
2008
15 years 6 months ago
2008
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...
178
Voted
SPATIALCOGNITION
2000
Springer
15 years 7 months ago
2000
Springer
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
123
Voted
SARA
2009
Springer
15 years 10 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...