1166 search results - page 106 / 234 » Negotiating Using Rewards |
115
click to vote
ICTAI
2005
IEEE
15 years 7 months ago
2005
IEEE
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
99
Voted
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
The goal of Reinforcement learning (RL) is to maximize reward (minimize cost) in a Markov decision process (MDP) without knowing the underlying model a priori. RL algorithms tend ...
123
Voted
IJCAI
2007
15 years 3 months ago
2007
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
85
Voted
ICANN
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Taking neuromodulation as a mechanism underlying emotions, this paper investigates how such a mechanism can bias an artificial neural network towards exploration of new ...
135
Voted
FORMATS
2003
Springer
15 years 7 months ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...