For a variety of reasons, a number of recent works have studied the classic communication problem INDEX, and its variant AUGMENTED-INDEX, from a tradeoff perspective: how much communication can Alice (the player holding the n data bits) save if Bob (the player holding the index) communicates a nontrivial amount? Recently, Magniez et al. (STOC, 2010), Chakrabarti et al. (FOCS, 2010) and Jain and...

This paper studies a strategic supply chain management problem to design robust networks that perform well under both normal conditions and when disruptions strike. We present a mixed-integer programming model whose objective is to minimize the nominal cost (the cost when no disruptions occur) while reducing the disruption risk using the p-robustness criterion (which bounds the cost in disrupti...

This paper studies a strategic supply chain management problem to design reliable networks that perform as well as possible under normal conditions, while also performing relatively well when disruptions strike. We present a mixed-integer programming model whose objective is to minimize the nominal cost (the cost when no disruptions occur) while reducing the disruption risk using the p-robustne...

In this paper we study the tradeoff between parallelism and communication cost in a map-reduce computation. For any problem that is not “embarrassingly parallel,” the finer we partition the work of the reducers so that more parallelism can be extracted, the greater will be the total communication between mappers and reducers. We introduce a model of problems that can be solved in a single round...

The smart grid is envisioned to be a completely automated infrastructure that will require little or no human intervention to address growing demands of the grid consumers. This is made possible by the integration of latest information and communications technologies (ICT) into the power grid. The various sensors installed in the smart grid have the capability to report back information related...

A key problem in mechanism design is the construction of protocols that reach socially efficient decisions with minimal information revelation. This can reduce agent communication, and further, potentially increase privacy in the sense that agents reveal no more private information than is needed to determine an optimal outcome. This is not always possible: previous work has explored the tradeo...

Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in solving time-critical problems such as planning and scheduling, belief network evaluation, and information gathering. To exploit this tradeoff, a system must be able to decide when to stop deliberation and act on the currently available solution. This paper analyzes the characteristics of...

Computing systems play a vital role in our society, influencing both industry and academia, and the spectrum of applications executing on these systems and their complexity varies widely. Future generations of computing systems are expected to execute processes which are more complex and larger in size. The tasks comprising these applications will have many constraints associated with their exe...