942 search results - page 71 / 189 » Distance Constraint Satisfaction Problems |
ICALP
2010
Springer
15 years 2 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 ...
SIAMDM
2010
14 years 8 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
ATAL
2007
Springer
15 years 2 months ago
2007
Springer
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...
CP
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
135
click to vote
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...