500 search results - page 87 / 100 » Managing of Cooperative Genetic Algorithms by Intelligent Ag... |
101
click to vote
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...
AAAI
2008
15 years 2 months ago
2008
In this paper, we study a sequential decision making problem. The objective is to maximize the average reward accumulated over time subject to temporal cost constraints. The novel...
106
click to vote
AAAI
2012
13 years 2 months ago
2012
Many signals of interest are corrupted by faults of an unknown type. We propose an approach that uses Gaussian processes and a general “fault bucket” to capture a priori uncha...
107
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
111
click to vote
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...