196 search results - page 17 / 40 » New Algorithms for Optimal Online Checkpointing |
100
click to vote
COLT
2010
Springer
14 years 9 months ago
2010
Springer
We present a new method for regularized convex optimization and analyze it under both online and stochastic optimization settings. In addition to unifying previously known firstor...
AAAI
2007
15 years 2 months ago
2007
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
ESA
2001
Springer
15 years 4 months ago
2001
Springer
Suppose that a program makes a sequence of m accesses (references) to data blocks, the cache can hold k < m blocks, an access to a block in the cache incurs one time unit, and ...
108
click to vote
JRTIP
2010
14 years 6 months ago
2010
In this paper, we propose a cascaded version of the online boosting algorithm to speed-up the execution time and guarantee real-time performance even when employing a large number ...
112
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
— In this paper, we propose a new on-line learning algorithm for the non-linear system identification: the swarm intelligence aided multi-innovation recursive least squares (SIM...