102 search results - page 15 / 21 » Constraint Satisfaction Problems of Bounded Width |
AAAI
2008
14 years 12 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
DISOPT
2007
14 years 9 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
IWPC
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper presents a framework for software architecture recovery and restructuring. The user specifies a high level abstraction view of the system using a structured pattern la...
AAAI
1996
14 years 11 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...