2861 search results - page 55 / 573 » Constraint Programming |
ICLP
2007
Springer
15 years 3 months ago
2007
Springer
IPCO
2007
14 years 11 months ago
2007
Consider an integer program max(ct x : Ax = b, x ≥ 0, x ∈ Zn ) where A ∈ Zm×n , b ∈ Zm , and c ∈ Zn . We show that the integer program can be solved in pseudo-polynomial...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to ...
ENTCS
2007
14 years 9 months ago
2007
In this paper we present our rst approach to model and verify biological systems using ntcc, a concurrent constraint process calculus. We argue that the partial information const...
AAAI
2008
15 years 2 days ago
2008
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...