Sciweavers

71 search results - page 4 / 15
» Optimal online assignment with forecasts
Sort
View
STACS
2004
Springer
14 years 3 months ago
An Algorithmic View on OVSF Code Assignment
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
Thomas Erlebach, Riko Jacob, Matús Mihal&aa...
AAAI
2008
14 years 4 days ago
Expressive Banner Ad Auctions and Model-Based Online Optimization for Clearing
We present the design of a banner advertising auction which is considerably more expressive than current designs. We describe a general model of expressive ad contracts/bidding an...
Craig Boutilier, David C. Parkes, Tuomas Sandholm,...
WADS
2007
Springer
131views Algorithms» more  WADS 2007»
14 years 3 months ago
On the Robustness of Graham's Algorithm for Online Scheduling
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
Michael Gatto, Peter Widmayer
TALG
2010
101views more  TALG 2010»
13 years 8 months ago
Reasoning about online algorithms with weighted automata
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
Benjamin Aminof, Orna Kupferman, Robby Lampert
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
14 years 3 months ago
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks