11910 search results - page 179 / 2382 » Online Learning Algorithms |
105
click to vote
RTSS
1994
IEEE
15 years 4 months ago
1994
IEEE
The problem of uniprocessor scheduling under conditions of overload is investigated. The system objective is to maximzze the number of tasks that complete by their deadlines. For ...
118
Voted
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
Most motion-based tracking algorithms assume that objects undergo rigid motion, which is most likely disobeyed in real world. In this paper, we present a novel motionbased trackin...
ICAISC
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Several methods were proposed to reduce the number of instances (vectors) in the learning set. Some of them extract only bad vectors while others try to remove as many in...
SODA
2008
ACM
15 years 2 months ago
2008
ACM
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
116
click to vote
ATVA
2011
Springer
14 years 23 days ago
2011
Springer
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....