3049 search results - page 33 / 610 » On the Convergence of Bound Optimization Algorithms |
113
click to vote
COLT
2000
Springer
15 years 8 months ago
2000
Springer
We model reinforcement learning as the problem of learning to control a Partially Observable Markov Decision Process ( ¢¡¤£¦¥§ ), and focus on gradient ascent approache...
127
Voted
CASC
2009
Springer
15 years 10 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
139
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...
132
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
114
click to vote
CP
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...