Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
It has long been recognized that users can have complex preferences on plans. Non-intrusive learning of such preferences by observing the plans executed by the user is an attracti...
Nan Li, William Cushing, Subbarao Kambhampati, Sun...
Service composition is a new paradigm for efficient and cost-effective IT service provisioning over the network. To safely and effectively deploy composed services within an organi...
In this paper, we consider a secondary link sharing the spectrum with a primary link in a fading cognitive radio (CR) network. Instead of applying the conventional interference pow...
Xin Kang, Rui Zhang, Ying-Chang Liang, Hari Krishn...
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...