Many Grid applications involve combining computational and data access components into complex workflows. A distinction is generally made between mechanisms to compose components ...
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
We propose a settlement mechanism for optimally scheduling real time electricity consumption which is suitable for an automated demand response control system. Our proposed settlem...
Anthony Papavasiliou, Haitham Hindi, Daniel Greene
Clustering performance can often be greatly improved by
leveraging side information. In this paper, we consider constrained
clustering with pairwise constraints, which specify
s...
In this paper, we introduce the concept of a QA-Pagelet to refer to the content region in a dynamic page that contains query matches. We present THOR, a scalable and efficient min...