In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
Many classes of image data span a low dimensional nonlinear space embedded in the natural high dimensional image space. We adopt and generalize a recently proposed dimensionality ...
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...