287 search results - page 22 / 58 » An Algebraic Approach to Constraint Satisfaction Problems |
161
Voted
CP
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we present and evaluate an evolutionary approach for learning new constraint satisfaction algorithms, specifically for MAX-SAT optimisation problems. Our approach of...
160
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
163
Voted
AAAI
2000
15 years 6 months ago
2000
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
174
click to vote
CP
2007
Springer
15 years 11 months ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
139
click to vote
NIPS
2000
15 years 6 months ago
2000
We study the problem of combining the outcomes of several different classifiers in a way that provides a coherent inference that satisfies some constraints. In particular, we deve...