601 search results - page 22 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
181
click to vote
CP
2007
Springer
16 years 15 hour 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...
208
click to vote
PACT
1999
Springer
15 years 10 months ago
1999
Springer
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...
171
click to vote
PRICAI
2004
Springer
15 years 11 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
142
click to vote
KBS
2007
15 years 5 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
167
click to vote
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...