46 search results - page 1 / 10 » Measures of Intrinsic Hardness for Constraint Satisfaction P... |
SOFSEM
2004
Springer
13 years 9 months ago
2004
Springer
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
CISSE
2009
Springer
13 years 8 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
CSR
2007
Springer
13 years 10 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
SETN
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. Constructive methods obtain solutions to constraint satisfaction problem instances by iteratively extending consistent partial assignments. In this research, we study the...