196 search results - page 3 / 40 » New Algorithms for Optimal Online Checkpointing |
ESA
2006
Springer
13 years 11 months ago
2006
Springer
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
NIPS
2008
13 years 8 months ago
2008
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...
EOR
2007
13 years 7 months ago
2007
In today’s competitive electronic marketplace, companies try to create long-lasting relations with their online customers. Log files and registration forms generate millions of...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...