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...
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
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...
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
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...