We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
Eran Halperin, Guy Kortsarz, Robert Krauthgamer, A...
We propose a lightweight approach for certification of Java bytecode monitor inlining using proof-carrying code. The main purpose of such a framework is to enable development use ...
—For the sake of maximizing the network lifetime, we propose a novel placement scheme for mobile data collectors in Underwater Acoustic Sensor Networks (UASNs). Our scheme is bas...
We present an auto-tuning approach to optimize application performance on emerging multicore architectures. The methodology extends the idea of searchbased performance optimizatio...
Samuel Williams, Jonathan Carter, Leonid Oliker, J...