Sciweavers

450 search results - page 4 / 90
» Adaptive Algorithms for Online Decision Problems
Sort
View
ADMA
2006
Springer
110views Data Mining» more  ADMA 2006»
13 years 10 months ago
Learning with Local Drift Detection
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Gladys Castillo
JMLR
2002
83views more  JMLR 2002»
13 years 6 months ago
On Online Learning of Decision Lists
A fundamental open problem in computational learning theory is whether there is an attribute efficient learning algorithm for the concept class of decision lists (Rivest, 1987; Bl...
Ziv Nevo, Ran El-Yaniv
ICONIP
2009
13 years 4 months ago
A Markov Model for Multiagent Patrolling in Continuous Time
Abstract. We present a model for the multiagent patrolling problem with continuous-time. An anytime and online algorithm is then described and extended to asynchronous multiagent d...
Jean-Samuel Marier, Camille Besse, Brahim Chaib-dr...
SAC
2004
ACM
14 years 13 days ago
Forest trees for on-line data
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...
João Gama, Pedro Medas, Ricardo Rocha
OSDI
2008
ACM
14 years 7 months ago
From Optimization to Regret Minimization and Back Again
Internet routing is mostly based on static information-it's dynamicity is limited to reacting to changes in topology. Adaptive performance-based routing decisions would not o...
Ioannis C. Avramopoulos, Jennifer Rexford, Robert ...