Sciweavers

3088 search results - page 65 / 618
» Online Passive-Aggressive Algorithms
Sort
View
SODA
1994
ACM
75views Algorithms» more  SODA 1994»
14 years 11 months ago
Online Interval Scheduling
Richard J. Lipton, Andrew Tomkins
SODA
1996
ACM
92views Algorithms» more  SODA 1996»
14 years 11 months ago
On-line Generalized Steiner Problem
Baruch Awerbuch, Yossi Azar, Yair Bartal
SODA
1992
ACM
96views Algorithms» more  SODA 1992»
14 years 11 months ago
Lower Bounds for On-Line Graph Coloring
Magnús M. Halldórsson, Mario Szegedy
ESA
2010
Springer
152views Algorithms» more  ESA 2010»
14 years 10 months ago
Improved Bounds for Online Stochastic Matching
Bahman Bahmani, Michael Kapralov
TCS
2008
14 years 9 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,...