Sciweavers

1916 search results - page 235 / 384
» Reconfiguring a state machine
Sort
View
ICML
1999
IEEE
14 years 9 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
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...
Rajesh Parekh, Vasant Honavar
ICML
1999
IEEE
14 years 9 months ago
Implicit Imitation in Multiagent Reinforcement Learning
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...
Bob Price, Craig Boutilier
ICML
1999
IEEE
14 years 9 months ago
Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes
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...
Sebastian Thrun, John Langford, Dieter Fox
ICML
1997
IEEE
14 years 9 months ago
Learning Belief Networks in the Presence of Missing Values and Hidden Variables
In recent years there has been a flurry of works on learning probabilistic belief networks. Current state of the art methods have been shown to be successful for two learning scen...
Nir Friedman
ICML
1995
IEEE
14 years 9 months ago
Learning Policies for Partially Observable Environments: Scaling Up
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...
Michael L. Littman, Anthony R. Cassandra, Leslie P...