Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
In this paper we study stochastic dynamic games with many players that are relevant for a wide range of social, economic, and engineering applications. The standard solution conce...
Sachin Adlakha, Ramesh Johari, Gabriel Y. Weintrau...
Given the increasing complexity of multi-processor systems-onchip, a wide range of parameters must be tuned to find the best trade-offs in terms of the selected system figures of ...
Giovanni Mariani, Aleksandar Brankovic, Gianluca P...
Dueto diffuse nature of lightphotons, Diffuse Optical Tomography (DOT) image reconstruction is a challenging 3D problem with a relatively large number of unknowns and limited meas...
Murat Guven, Birsen Yazici, Xavier Intes, Britton ...
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...