1381 search results - page 32 / 277 » Computational Complexity of Constraint Satisfaction |
JUCS
2006
13 years 9 months ago
2006
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
CP
2009
Springer
14 years 10 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
AGI
2008
13 years 11 months ago
2008
Whereas symbol
CP
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to ...
CSL
2010
Springer
13 years 10 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...