Sciweavers

3088 search results - page 65 / 618
» Online Passive-Aggressive Algorithms
Sort
View
105
Voted
SODA
1994
ACM
75views Algorithms» more  SODA 1994»
15 years 6 months ago
Online Interval Scheduling
Richard J. Lipton, Andrew Tomkins
114
Voted
SODA
1996
ACM
92views Algorithms» more  SODA 1996»
15 years 6 months ago
On-line Generalized Steiner Problem
Baruch Awerbuch, Yossi Azar, Yair Bartal
123
Voted
SODA
1992
ACM
96views Algorithms» more  SODA 1992»
15 years 6 months ago
Lower Bounds for On-Line Graph Coloring
Magnús M. Halldórsson, Mario Szegedy
ESA
2010
Springer
152views Algorithms» more  ESA 2010»
15 years 6 months ago
Improved Bounds for Online Stochastic Matching
Bahman Bahmani, Michael Kapralov
138
Voted
TCS
2008
15 years 5 months ago
On the power of lookahead in on-line server routing problems
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
Luca Allulli, Giorgio Ausiello, Vincenzo Bonifaci,...