Sciweavers

3016 search results - page 120 / 604
» The Online Transportation Problem
Sort
View
ANOR
2010
112views more  ANOR 2010»
15 years 2 months ago
Online stochastic optimization under time constraints
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Pascal Van Hentenryck, Russell Bent, Eli Upfal
143
Voted
JMLR
2010
161views more  JMLR 2010»
14 years 10 months ago
Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization
We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning...
Lin Xiao
KDD
2012
ACM
292views Data Mining» more  KDD 2012»
13 years 6 months ago
Online allocation of display ads with smooth delivery
Display ads on the Internet are often sold in bundles of thousands or millions of impressions over a particular time period, typically weeks or months. Ad serving systems that ass...
Anand Bhalgat, Jon Feldman, Vahab S. Mirrokni
ALGORITHMICA
2010
107views more  ALGORITHMICA 2010»
15 years 4 months ago
A Universal Online Caching Algorithm Based on Pattern Matching
We present a universal algorithm for the classical online problem of caching or demand paging. We consider the caching problem when the page request sequence is drawn from an unkn...
Gopal Pandurangan, Wojciech Szpankowski
WEBI
2005
Springer
15 years 9 months ago
Providing Expert Advice by Analogy for On-Line Help
One of the principal problems of online help is the mismatch between the specialized knowledge and technical vocabulary of experts who are providing the help, and the relative naÃ...
Henry Lieberman, Ashwani Kumar