714 search results - page 119 / 143 » Lexicographically-ordered constraint satisfaction problems |
PPDP
2010
Springer
13 years 8 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
AI
2010
Springer
13 years 10 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
ECAI
2006
Springer
14 years 1 months ago
2006
Springer
Several formalisms exist to express and solve decision problems. Each is designed to capture different kinds of knowledge: utilities expressing preferences, uncertainties on the en...
FLAIRS
2003
13 years 11 months ago
2003
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
CP
1998
Springer
14 years 2 months ago
1998
Springer
We study how constraint-based static analysis can be applied to the automated and systematic debugging of program errors. Strongly moding and constraint-based mode analysis are tur...