Many real-life constraints describing relations between the problem variables have complex semantics and the constraint domain is defined using a table of compatible tuples rather ...
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint pro...
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...
For decentralized control problems with quadratically invariant information constraints, the optimal controller may be found efficiently. In this paper, we show that there are sys...
We present a general semidefinite relaxation scheme for general n-variate quartic polynomial optimization under homogeneous quadratic constraints. Unlike the existing sum-of-squar...