2974 search results - page 73 / 595 » Model-Driven Constraint Programming |
137
click to vote
IPCO
2007
15 years 7 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...
160
click to vote
POPL
1995
ACM
15 years 9 months ago
1995
ACM
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
139
click to vote
CP
2006
Springer
15 years 9 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 ...
169
click to vote
ENTCS
2007
15 years 6 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...