11910 search results - page 194 / 2382 » Online Learning Algorithms |
IPL
2006
15 years 23 days ago
2006
We consider the online scheduling problem with m - 1, m 2, uniform machines each with a processing speed of 1, and one machine with a speed of s, 1 s 2, to minimize the makespa...
97
Voted
JCO
2006
15 years 23 days ago
2006
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...
104
click to vote
PAKDD
2005
ACM
15 years 6 months ago
2005
ACM
We study the problem of mining frequent value sets from a large sensor network. We discuss how sensor stream data could be represented that facilitates efficient online mining and ...
103
Voted
SIGECOM
2009
ACM
15 years 7 months ago
2009
ACM
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
107
click to vote
SIAMSC
2010
14 years 11 months ago
2010
Frequently, the computation of derivatives for optimizing time-dependent problems is based on the integration of the adjoint differential equation. For this purpose, the knowledge...