Sciweavers

4843 search results - page 893 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
IPPS
2009
IEEE
15 years 4 months ago
Coupled placement in modern data centers
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...
Madhukar R. Korupolu, Aameek Singh, Bhuvan Bamba
ATAL
2009
Springer
15 years 4 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
INFOCOM
2008
IEEE
15 years 4 months ago
Towards Optimal Resource Allocation in Partial-Fault Tolerant Applications
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
Nikhil Bansal, Ranjita Bhagwan, Navendu Jain, Yoon...
BROADNETS
2007
IEEE
15 years 4 months ago
Joint monitoring and routing in wireless sensor networks using robust identifying codes
Wireless Sensor Networks (WSNs) provide an important means of monitoring the physical world, but their ons present challenges to fundamental network services such as routing. In t...
Moshe Laifenfeld, Ari Trachtenberg, Reuven Cohen, ...
FOCS
2007
IEEE
15 years 4 months ago
The Power of Quantum Systems on a Line
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
Dorit Aharonov, Daniel Gottesman, Sandy Irani, Jul...