463 search results - page 27 / 93 » Localizing Search in Reinforcement Learning |
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
One of the key problems in reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large or even continuous Markov decision processes (...
ESANN
2003
15 years 1 months ago
2003
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
ICML
2003
IEEE
16 years 17 days ago
2003
IEEE
A novel native stochastic local search algorithm for solving k-term DNF problems is presented. It is evaluated on hard k-term DNF problems that lie on the phase transition and com...
111
click to vote
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Many real-world applications of AI require both probability and first-order logic to deal with uncertainty and structural complexity. Logical AI has focused mainly on handling com...
ICRA
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract— We consider the problem of apprenticeship learning when the expert’s demonstration covers only a small part of a large state space. Inverse Reinforcement Learning (IR...