Sciweavers

614 search results - page 108 / 123
» Resource Minimization Job Scheduling
Sort
View
ICALP
2011
Springer
14 years 5 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 1 months ago
Restricted Strip Covering and the Sensor Cover Problem
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh...
VLSID
2009
IEEE
142views VLSI» more  VLSID 2009»
16 years 2 months ago
Floorplanning for Partial Reconfiguration in FPGAs
Partial Reconfiguration on heterogeneous Field Programmable Gate Arrays (FPGA) with millions of gates yields better utilization of resources by swapping in and out the active modu...
Pritha Banerjee, Megha Sangtani, Susmita Sur-Kolay
ICDE
2010
IEEE
195views Database» more  ICDE 2010»
15 years 2 months ago
Statistics-driven workload modeling for the Cloud
— A recent trend for data-intensive computations is to use pay-as-you-go execution environments that scale transparently to the user. However, providers of such environments must...
Archana Ganapathi, Yanpei Chen, Armando Fox, Randy...
ATVA
2005
Springer
202views Hardware» more  ATVA 2005»
15 years 7 months ago
Model Checking Real Time Java Using Java PathFinder
Abstract. The Real Time Specification for Java (RTSJ) is an augmentation of Java for real time applications of various degrees of hardness. The central features of RTSJ are real t...
Gary Lindstrom, Peter C. Mehlitz, Willem Visser