3084 search results - page 193 / 617 » Learning to Take Actions |
132
click to vote
KI
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. This paper investigates symbolic heuristic search with BDDs for solving domain-independent action planning problems cost-optimally. By distributimpact of operators that t...
195
Voted
WWW
2010
ACM
15 years 11 months ago
2010
ACM
Recommender systems are an important component of many websites. Two of the most popular approaches are based on matrix factorization (MF) and Markov chains (MC). MF methods learn...
153
Voted
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
A central problem in artificial intelligence is to choose actions to maximize reward in a partially observable, uncertain environment. To do so, we must learn an accurate model of ...
145
click to vote
NIPS
1993
15 years 5 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
163
click to vote
JAIR
2011
14 years 11 months ago
2011
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...