3928 search results - page 602 / 786 » Optimal suffix selection |
161
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
The paper explores a very simple agent design method called Q-decomposition, wherein a complex agent is built from simpler subagents. Each subagent has its own reward function and...
159
click to vote
ICML
2002
IEEE
16 years 7 months ago
2002
IEEE
We present several new algorithms for multiagent reinforcement learning. A common feature of these algorithms is a parameterized, structured representation of a policy or value fu...
193
click to vote
ICML
1995
IEEE
16 years 7 months ago
1995
IEEE
Partially observable Markov decision processes (pomdp's) model decision problems in which an agent tries to maximize its reward in the face of limited and/or noisy sensor fee...
139
click to vote
ICSE
2009
IEEE-ACM
16 years 7 months ago
2009
IEEE-ACM
A variety of compilers, static analyses, and testing frameworks rely heavily on path frequency information. Uses for such information range from optimizing transformations to bug ...
162
click to vote
SIGSOFT
2009
ACM
16 years 7 months ago
2009
ACM
A program is reentrant if distinct executions of that program on distinct inputs cannot affect each other. Reentrant programs have the desirable property that they can be deployed...