1051 search results - page 26 / 211 » Foundations of Constraint Satisfaction |
172
click to vote
ATAL
2007
Springer
16 years 24 days ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
154
click to vote
CPAIOR
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic ...
140
click to vote
LICS
2006
IEEE
16 years 19 days ago
2006
IEEE
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...
194
click to vote
CP
2004
Springer
16 years 8 hour ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
162
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...