450 search results - page 14 / 90 » Adaptive Algorithms for Online Decision Problems |
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we study a sequential decision making problem. The objective is to maximize the total reward while satisfying constraints, which are defined at every time step. The...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
Robust sequence prediction is an essential component of an intelligent agent acting in a dynamic world. We consider the case of near-future event prediction by an online learning ...
KDD
2003
ACM
14 years 8 months ago
2003
ACM
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...