2467 search results - page 358 / 494 » Finite State Machines |
108
click to vote
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
This paper addresses the problem of constructing good action selection policies for agents acting in partially observable environments, a class of problems generally known as Part...
ICML
2003
IEEE
16 years 1 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...
107
click to vote
ICML
1999
IEEE
16 years 1 months ago
1999
IEEE
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
104
Voted
ICML
1999
IEEE
16 years 1 months ago
1999
IEEE
Imitation is actively being studied as an effective means of learning in multi-agent environments. It allows an agent to learn how to act well (perhaps optimally) by passively obs...
117
click to vote
ICML
1999
IEEE
16 years 1 months ago
1999
IEEE
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...