1206 search results - page 18 / 242 » Convergence analysis of online algorithms |
NIPS
1994
13 years 9 months ago
1994
The performance of on-line algorithms for learning dichotomies is studied. In on-line learning, the number of examples P is equivalent to the learning time, since each example is ...
WADS
2009
Springer
14 years 3 months ago
2009
Springer
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The convergence problem of the Laplace-Beltrami operators plays an essential role in the convergence analysis of the numerical simulations of some important geometric partial diff...
INFOCOM
2000
IEEE
14 years 25 days ago
2000
IEEE
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
We consider approximate policy evaluation for finite state and action Markov decision processes (MDP) in the off-policy learning context and with the simulation-based least square...