189 search results - page 29 / 38 » Models and Algorithms for Stochastic Online Scheduling |
STACS
1999
Springer
14 years 26 days ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
ICPP
1998
IEEE
14 years 26 days ago
1998
IEEE
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
INFOCOM
2000
IEEE
14 years 1 months ago
2000
IEEE
Abstract—A challenging aspect of mobile communications consists in exploring ways in which the available run time of terminals can be maximized. In this paper, we present a detai...
ARC
2007
Springer
13 years 8 months ago
2007
Springer
: The parity space approach to fault detection and isolation (FDI) has been developed during the last twenty years, and the focus here is to describe its application to stochastic ...