Sciweavers

1206 search results - page 51 / 242
» Convergence analysis of online algorithms
Sort
View
NIPS
2008
14 years 11 months ago
Signal-to-Noise Ratio Analysis of Policy Gradient Algorithms
Policy gradient (PG) reinforcement learning algorithms have strong (local) convergence guarantees, but their learning performance is typically limited by a large variance in the e...
John W. Roberts, Russ Tedrake
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 4 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
94
Voted
DRR
2003
14 years 11 months ago
Automated labeling of bibliographic data extracted from biomedical online journals
A prototype system has been designed to automate the extraction of bibliographic data (e.g., article title, authors, , affiliation and others) from online biomedical journals to p...
Jongwoo Kim, Daniel X. Le, George R. Thoma
ICALP
2011
Springer
14 years 1 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
ICDAR
2009
IEEE
15 years 4 months ago
A Probabilistic Framework for Soft Target Learning in Online Cursive Handwriting Recognition
To develop effective learning algorithms for online cursive word recognition is still a challenge research issue. In this paper, we propose a probabilistic framework to model the ...
Xiaoyuan Zhu, Yong Ge, Feng-Jun Guo, Li-Xin Zhen