Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
In this paper, we present an analysis and synthesis framework for guaranteeing that the phase of a single-input, single-output closed-loop transfer function is contained in the int...
Wassim M. Haddad, VijaySekhar Chellaboina, Behnood...
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...