463 search results - page 29 / 93 » Localizing Search in Reinforcement Learning |
BMCBI
2008
13 years 10 months ago
2008
Background: Inferring gene regulatory networks from data requires the development of algorithms devoted to structure extraction. When only static data are available, gene interact...
ICML
2001
IEEE
14 years 10 months ago
2001
IEEE
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...
AIPS
2008
14 years 6 days ago
2008
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
ICML
2008
IEEE
14 years 10 months ago
2008
IEEE
We present a reinforcement learning architecture, Dyna-2, that encompasses both samplebased learning and sample-based search, and that generalises across states during both learni...
EWCBR
2008
Springer
13 years 11 months ago
2008
Springer
To meet time constraints, a CBR system must control the time spent searching in the case base for a solution. In this paper, we presents the results of a case study comparing the p...