Sciweavers

127 search results - page 24 / 26
» Measuring the Hardness of SAT Instances
Sort
View
132
Voted
SOSP
2003
ACM
15 years 10 months ago
Xen and the art of virtualization
Numerous systems have been designed which use virtualization to subdivide the ample resources of a modern computer. Some require specialized hardware, or cannot support commodity ...
Paul Barham, Boris Dragovic, Keir Fraser, Steven H...
SPAA
2009
ACM
15 years 8 months ago
Distributed algorithms for QoS load balancing
We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decre...
Heiner Ackermann, Simon Fischer, Martin Hoefer, Ma...
211
Voted
OOPSLA
2009
Springer
15 years 8 months ago
Static extraction and conformance analysis of hierarchical runtime architectural structure using annotations
An object diagram makes explicit the object structures that are only implicit in a class diagram. An object diagram may be missing and must extracted from the code. Alternatively,...
Marwan Abi-Antoun, Jonathan Aldrich
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
15 years 8 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
ICAC
2006
IEEE
15 years 8 months ago
The Laundromat Model for Autonomic Cluster Computing
Traditional High Performance Computing systems require extensive management and suffer from security and configuration problems. This paper presents a new clustermanagement syste...
Jacob Gorm Hansen, Eske Christiansen, Eric Jul