3049 search results - page 416 / 610 » On the Convergence of Bound Optimization Algorithms |
136
click to vote
ICML
1998
IEEE
16 years 5 months ago
1998
IEEE
This paper presents a new approach to hierarchical reinforcement learning based on the MAXQ decomposition of the value function. The MAXQ decomposition has both a procedural seman...
135
click to vote
SCALESPACE
2009
Springer
15 years 11 months ago
2009
Springer
We propose a regularization method for solving ill-posed problems, under the assumption that the solutions are piecewise constant functions with unknown level sets and unknown leve...
141
click to vote
ICNSC
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— In time varying packet-switched networks, delivering data with high reliability using a limited amount of network resources is highly desirable. To capture the trade-of...
127
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. How could one estimate the total number of clicks a new advertisement could potentially receive in the current market? This question, called the click volume estimation p...
120
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
A common problem in genetic programming search algorithms is destructive crossover in which the offspring of good parents generally has worse performance than the parents. Design...