Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
3088
search results - page 65 / 618
»
Online Passive-Aggressive Algorithms
Sort
relevance
views
votes
recent
update
View
thumb
title
105
Voted
SODA
1994
ACM
75
views
Algorithms
»
more
SODA 1994
»
Online Interval Scheduling
15 years 6 months ago
Download
www.mistaconference.org
Richard J. Lipton, Andrew Tomkins
claim paper
Read More »
114
Voted
SODA
1996
ACM
92
views
Algorithms
»
more
SODA 1996
»
On-line Generalized Steiner Problem
15 years 6 months ago
Download
www.cs.jhu.edu
Baruch Awerbuch, Yossi Azar, Yair Bartal
claim paper
Read More »
123
Voted
SODA
1992
ACM
96
views
Algorithms
»
more
SODA 1992
»
Lower Bounds for On-Line Graph Coloring
15 years 6 months ago
Download
www.tcs.fudan.edu.cn
Magnús M. Halldórsson, Mario Szegedy
claim paper
Read More »
100
click to vote
ESA
2010
Springer
152
views
Algorithms
»
more
ESA 2010
»
Improved Bounds for Online Stochastic Matching
15 years 6 months ago
Download
www.stanford.edu
Bahman Bahmani, Michael Kapralov
claim paper
Read More »
138
Voted
TCS
2008
84
views
Theoretical Computer Science
»
more
TCS 2008
»
On the power of lookahead in on-line server routing problems
15 years 5 months ago
Download
www.dis.uniroma1.it
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,...
claim paper
Read More »
« Prev
« First
page 65 / 618
Last »
Next »