3088 search results - page 6 / 618 » Online Passive-Aggressive Algorithms |
COLT
2010
Springer
13 years 5 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
FAW
2010
Springer
13 years 6 months ago
2010
Springer
The newsvendor problem describes the dilemma of a newspaper salesman—how many papers should he purchase each day to resell, when he doesn’t know the demand? We develop approach...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
—The fundamental problem of multiple secondary users contending for opportunistic spectrum access over multiple channels in cognitive radio networks has been formulated recently ...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items, respectively) arrive over time, which must be p...
ECRTS
2009
IEEE
13 years 5 months ago
2009
IEEE
Some applications for real-time scheduling have target demands in addition to the commonly used starttime and deadline constraints: a task should be executed at a target point in ...