2109 search results - page 20 / 422 » Solving Necklace Constraint Problems |
160
click to vote
PACT
1999
Springer
15 years 6 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 ...
118
click to vote
SIAMJO
2000
15 years 1 months ago
2000
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
110
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
105
click to vote
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
This demonstration presents the concepts, design, and implementation of SCDE, a relational database systems extended with the ability to solve constraint satisfaction problems (CS...
137
click to vote
DEXA
2005
Springer
15 years 7 months ago
2005
Springer
The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specifica...