230 search results - page 6 / 46 » Constraint Satisfaction with Delayed Evaluation |
105
click to vote
ECAI
2004
Springer
15 years 7 months ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
122
click to vote
ECSQARU
2009
Springer
14 years 11 months ago
2009
Springer
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
123
click to vote
AIMSA
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
112
click to vote
SARA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
115
click to vote
CPAIOR
2008
Springer
15 years 3 months ago
2008
Springer
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a complete, constructive search technique that has been shown to out-perform standard constructive search techniques on ...