Sciweavers

4903 search results - page 187 / 981
» The Set Covering Machine
Sort
View
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 9 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
AVI
2010
13 years 7 months ago
Seeing the self in the washing machine: the deep affordance of 2.0 philosophy in the household appliance domain
The acceleration of rhythm of everyday life requires efficiency and flexibility in daily routines. The real expectations and needs of people concerning intelligent home devices sh...
Caterina Calefato, Enrico Frumento, Monica Milani,...
LCPC
2007
Springer
14 years 3 months ago
Supporting Huge Address Spaces in a Virtual Machine for Java on a Cluster
Abstract. To solve problems that require far more memory than a single machine can supply, data can be swapped to disk in some manner, it can be compressed, and/or the memory of mu...
Ronald Veldema, Michael Philippsen
LISA
2007
14 years 2 hour ago
Usher: An Extensible Framework for Managing Clusters of Virtual Machines
Usher is a virtual machine management system designed to impose few constraints upon the computing environment under its management. Usher enables administrators to choose how the...
Marvin McNett, Diwaker Gupta, Amin Vahdat, Geoffre...
COR
2011
13 years 4 months ago
Size-reduction heuristics for the unrelated parallel machines scheduling problem
In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job diļ¬...
Luis Fanjul-Peyro, Rubén Ruiz