1382 search results - page 23 / 277 » Formal Analysis of Online Algorithms |
144
click to vote
ESA
2006
Springer
15 years 9 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...
142
click to vote
EUSFLAT
2003
15 years 7 months ago
2003
The paper presents a specialised Partial Least Squares (PLS) algorithm for on-line calibration monitoring. At first, the basic scheme and philosophy of PEANO (Process Evaluation a...
143
click to vote
ALENEX
2008
15 years 7 months ago
2008
The multi-period newsvendor problem describes the dilemma of a newspaper salesman--how many paper should he purchase each day to resell, when he doesn't know the demand? We d...
166
click to vote
NIPS
2007
15 years 7 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
164
click to vote
NIPS
2008
15 years 7 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...