272 search results - page 11 / 55 » A Game-Theoretic Approach to Constraint Satisfaction |
111
click to vote
CP
1995
Springer
15 years 5 months ago
1995
Springer
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
123
click to vote
EVOW
2008
Springer
15 years 3 months ago
2008
Springer
This paper introduces a hybrid Tabu Search - Evolutionary Algorithm for solving the binary constraint satisfaction problem, called CTLEA. A continuation of an earlier introduced al...
101
click to vote
AAAI
2004
15 years 2 months ago
2004
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
107
click to vote
CSR
2006
Springer
15 years 5 months ago
2006
Springer
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
IPL
2007
15 years 1 months ago
2007
Abstract. The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework ...