Sciweavers

11910 search results - page 178 / 2382
» Online Learning Algorithms
Sort
View
111
Voted
ICML
2005
IEEE
16 years 1 months ago
Bayesian sparse sampling for on-line reward optimization
We present an efficient "sparse sampling" technique for approximating Bayes optimal decision making in reinforcement learning, addressing the well known exploration vers...
Tao Wang, Daniel J. Lizotte, Michael H. Bowling, D...
ICDAR
2003
IEEE
15 years 6 months ago
A Flexible Recognition Engine for Complex On-line Handwritten Character Recognition
A major feature of new mobiles terminals using penbased interfaces, such as personal assistants or e-book, is their personal character, implying that a good interface should be ea...
Sanparith Marukatat, Rudy Sicard, Thierry Arti&egr...
PKDD
2005
Springer
164views Data Mining» more  PKDD 2005»
15 years 6 months ago
Clustering and Prediction of Mobile User Routes from Cellular Data
Location-awareness and prediction of future locations is an important problem in pervasive and mobile computing. In cellular systems (e.g., GSM) the serving cell is easily availabl...
Kari Laasonen
FLAIRS
2010
15 years 3 months ago
Gamed-Based iSTART Practice: From MiBoard to Self-Explanation Showdown
MiBoard (Multiplayer Interactive Board Game) is an online, turnbased board game that was developed to assess the integration of game characteristics (point rewards, game-like inte...
Justin F. Brunelle
93
Voted
CRV
2009
IEEE
153views Robotics» more  CRV 2009»
15 years 7 months ago
Optimal Online Data Sampling or How to Hire the Best Secretaries
The problem of online sampling of data, can be seen as a generalization of the classical secretary problem. The goal is to maximize the probability of picking the k highest scorin...
Yogesh Girdhar, Gregory Dudek