We consider a generalized semi-infinite optimization problem (GSIP) of the form (GSIP) min{f(x) Ix E M}, where M = {x E N"lhi(x ) = 0, i = 1,...,m, G(x,y) /> 0, y E Y(x)} ...
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
This paper concerns the problem of resource reasoning in planning. It defines formally a constraint satisfaction problem, the Time and Resource Problem (T RP), in which resource r...
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
Pascal Van Hentenryck, Carleton Coffrin, Boris Gut...