283 search results - page 35 / 57 » Bounds on the Generalization Performance of Kernel Machine E... |
ICALP
2004
Springer
14 years 23 days ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
HPDC
2010
IEEE
13 years 7 months ago
2010
IEEE
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
UAI
2003
13 years 8 months ago
2003
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
JMLR
2010
13 years 5 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract--Reinforcement learning (RL) research typically develops algorithms for helping an RL agent best achieve its goals-however they came to be defined--while ignoring the rela...