4426 search results - page 164 / 886 » Concurrent Constraint Programming |
135
Voted
ICLP
2007
Springer
15 years 10 months ago
2007
Springer
107
Voted
ICLP
2007
Springer
15 years 10 months ago
2007
Springer
113
click to vote
IPCO
2007
15 years 6 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...
125
click to vote
CP
2006
Springer
15 years 8 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 ...
127
click to vote
AAAI
2008
15 years 7 months 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...