Sciweavers

3016 search results - page 175 / 604
» The Online Transportation Problem
Sort
View
COLOGNETWENTE
2008
15 years 5 months ago
Special Cases of Online Parallel Job Scheduling
In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, ...
Johann Hurink, Jacob Jan Paulus
EMNLP
2007
15 years 5 months ago
Online Learning of Relaxed CCG Grammars for Parsing to Logical Form
We consider the problem of learning to parse sentences to lambda-calculus representations of their underlying semantics and present an algorithm that learns a weighted combinatory...
Luke S. Zettlemoyer, Michael Collins
NIPS
2008
15 years 5 months ago
Online Prediction on Large Diameter Graphs
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
Mark Herbster, Guy Lever, Massimiliano Pontil
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 4 months ago
Adaptive Bound Optimization for Online Convex Optimization
We introduce a new online convex optimization algorithm that adaptively chooses its regularization function based on the loss functions observed so far. This is in contrast to pre...
H. Brendan McMahan, Matthew J. Streeter
JCO
2006
83views more  JCO 2006»
15 years 4 months ago
Separating online scheduling algorithms with the relative worst order ratio
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt