7930 search results - page 1227 / 1586 » Greedy in Approximation Algorithms |
210
click to vote
AAAI
2007
15 years 9 months ago
2007
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
183
Voted
AAAI
2007
15 years 9 months ago
2007
Partially Observable Markov Decision Processes (POMDPs) provide an appropriately rich model for agents operating under partial knowledge of the environment. Since finding an opti...
184
click to vote
AIPS
2008
15 years 9 months ago
2008
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
165
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Recent work in transfer learning has succeeded in making reinforcement learning algorithms more efficient by incorporating knowledge from previous tasks. However, such methods typ...
177
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we deal with the sequential decision making problem of agents operating in computational economies, where there is uncertainty regarding the trustworthiness of serv...