72 search results - page 7 / 15 » Learning Stochastic Finite Automata |
115
click to vote
ICMLA
2004
14 years 11 months ago
2004
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
104
click to vote
HCW
1999
IEEE
15 years 1 months ago
1999
IEEE
A framework for task assignment in heterogeneous computing systems is presented in this work. The framework is based on a learning automata model. The proposed model can be used f...
ICML
2009
IEEE
15 years 4 months ago
2009
IEEE
One of the main problems in probabilistic grammatical inference consists in inferring a stochastic language, i.e. a probability distribution, in some class of probabilistic models...
79
Voted
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
We cast model-free reinforcement learning as the problem of maximizing the likelihood of a probabilistic mixture model via sampling, addressing both the infinite and finite horizo...
COLT
1994
Springer
15 years 1 months ago
1994
Springer
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...