3088 search results - page 382 / 618 » Online Passive-Aggressive Algorithms |
155
click to vote
ICALP
2005
Springer
16 years 2 days ago
2005
Springer
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary time. We want to pack a sequence of unit fractions items (i.e., items with sizes ...
163
click to vote
ICTCS
2005
Springer
16 years 2 days ago
2005
Springer
We study the effect of laxity, or slack time, on the online scheduling of broadcasts with deadlines. The laxity of a request is defined to be the ratio between its span (differe...
192
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...
147
click to vote
UIST
2003
ACM
15 years 11 months ago
2003
ACM
People use their awareness of others' temporal patterns to plan work activities and communication. This paper presents algorithms for programatically detecting and modeling t...
160
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— We consider decision-making problems in Markov decision processes where both the rewards and the transition probabilities vary in an arbitrary (e.g., nonstationary) fashion. We...