Sciweavers

1050 search results - page 127 / 210
» Online scheduling in grids
Sort
View
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
14 years 9 months ago
Density-based clustering for real-time stream data
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
Yixin Chen, Li Tu
DSN
2008
IEEE
14 years 3 months ago
Automatic security assessment of critical cyber-infrastructures
This research investigates the automation of security assessment of the static and dynamic properties of cyberinfrastructures, with emphasis on the electrical power grid. We descr...
Zahid Anwar, Ravinder Shankesi, Roy H. Campbell
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 8 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
WWW
2002
ACM
14 years 9 months ago
Improvements in practical aspects of optimally scheduling web advertising
We addressed two issues concerning the practical aspects of optimally scheduling web advertising proposed by Langheinrich et al. [5], which scheduling maximizes the total number o...
Atsuyoshi Nakamura
IPL
2008
80views more  IPL 2008»
13 years 9 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra