185 search results - page 31 / 37 » Parameterized Complexity of Constraint Satisfaction Problems |
IJCAI
2001
13 years 9 months ago
2001
The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Satisfaction Problems (CSP). Its strength lies in that it is simple, empirically ef...
ICLP
2004
Springer
14 years 1 months ago
2004
Springer
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
ENDM
2000
13 years 7 months ago
2000
Planning and scheduling attracts an unceasing attention of computer science community. Several research areas like Artificial Intelligence, Operations Research and Constraint Prog...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Interactive configuration is the concept of assisting a user in selecting values for parameters that respect given constraints. It was originally inspired by the product configurat...