Sciweavers

3088 search results - page 81 / 618
» Online Passive-Aggressive Algorithms
Sort
View
CVPR
2010
IEEE
15 years 5 months ago
Online Multiple Instance Learning with No Regret
Multiple instance (MI) learning is a recent learning paradigm that is more flexible than standard supervised learning algorithms in the handling of label ambiguity. It has been u...
Li Mu, James Kwok, Lu Bao-liang
ICML
2007
IEEE
15 years 10 months ago
Combining online and offline knowledge in UCT
The UCT algorithm learns a value function online using sample-based search. The TD() algorithm can learn a value function offline for the on-policy distribution. We consider three...
Sylvain Gelly, David Silver
NOMS
2010
IEEE
173views Communications» more  NOMS 2010»
14 years 8 months ago
Dynamic resource allocation and power management in virtualized data centers
—We investigate optimal resource allocation and power management in virtualized data centers with time-varying workloads and heterogeneous applications. Prior work in this area u...
Rahul Urgaonkar, Ulas C. Kozat, Ken Igarashi, Mich...
SIAMDM
2002
124views more  SIAMDM 2002»
14 years 9 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
IPPS
2008
IEEE
15 years 4 months ago
Online scheduling in grids
This paper addresses nonclairvoyant and nonpreemptive online job scheduling in Grids. In the applied basic model, the Grid system consists of a large number of identical processor...
Uwe Schwiegelshohn, Andrei Tchernykh, Ramin Yahyap...