Sciweavers

1050 search results - page 194 / 210
» Online scheduling in grids
Sort
View
IOR
2002
135views more  IOR 2002»
13 years 7 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss
ICS
2005
Tsinghua U.
14 years 1 months ago
Continuous Replica Placement schemes in distributed systems
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
Thanasis Loukopoulos, Petros Lampsas, Ishfaq Ahmad
ICAC
2006
IEEE
14 years 1 months ago
QMON: QoS- and Utility-Aware Monitoring in Enterprise Systems
Abstract— The scale, reliability, and cost requirements of enterprise data centers require automation of center management. Examples include provisioning, scheduling, capacity pl...
Sandip Agarwala, Yuan Chen, Dejan S. Milojicic, Ka...
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 7 months ago
Neuroevolutionary optimization
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
Eva Volná
CSCW
2002
ACM
13 years 7 months ago
Work rhythms: analyzing visualizations of awareness histories of distributed groups
We examined records of minute-by-minute computer activity coupled with information about the location of the activity, online calendar appointments, and e-mail activity. We presen...
James Begole, John C. Tang, Randall B. Smith, Nico...