711 search results - page 36 / 143 » Amalgams of Constraint Satisfaction Problems |
105
click to vote
DAGSTUHL
2006
15 years 1 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
111
click to vote
FLAIRS
2007
15 years 2 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
HIS
2004
15 years 1 months ago
2004
This paper proposes the methods to solve the constraint satisfaction problems (CSPs) using Q'tron neural networks (NNs). A Q'tron NN is local-minima free if it is built ...
111
click to vote
CIE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
ESA
2006
Springer
15 years 3 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...