Sciweavers

706 search results - page 82 / 142
» Online Interval Scheduling
Sort
View
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 9 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
ACE
2004
182views Education» more  ACE 2004»
13 years 9 months ago
Facilitating Successful Online Computing Courses While Minimising Extra Tutor Workload
A key problem in facilitating a successful online course is the highly time -consuming nature of the administrative and pedagogical tasks involved. It is also difficult to achieve...
Stuart Young, Mae McSporran
INFOCOM
1999
IEEE
14 years 15 hour ago
An Effective and Efficient Traffic Smoothing Scheme for Delivery of Online VBR Media Streams
Traffic smoothing for delivery of online VBR media streams is one of the most important problems in designing multimedia systems. Given available client buffer and a window-slidin...
Ray-I Chang, Meng Chang Chen, Jan-Ming Ho, Ming-Ta...
WWW
2003
ACM
14 years 8 months ago
Adaptive on-line page importance computation
The computation of page importance in a huge dynamic graph has recently attracted a lot of attention because of the web. Page importance, or page rank is defined as the fixpoint o...
Serge Abiteboul, Mihai Preda, Gregory Cobena
SIGOPS
2010
179views more  SIGOPS 2010»
13 years 2 months ago
Online cache modeling for commodity multicore processors
Modern chip-level multiprocessors (CMPs) contain multiple processor cores sharing a common last-level cache, memory interconnects, and other hardware resources. Workloads running ...
Richard West, Puneet Zaroo, Carl A. Waldspurger, X...