Discretized pursuit learning automata
From MaRDI portal
Publication:3493280
DOI10.1109/21.105092zbMath0709.68064WikidataQ60328288 ScholiaQ60328288MaRDI QIDQ3493280
B. John Oommen, J. Kevin Lanctot
Publication date: 1990
Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/21.105092
68T05: Learning and adaptive systems in artificial intelligence
68Q45: Formal languages and automata
Related Items
Solving two‐armed Bernoulli bandit problems using a Bayesian learning automaton, A strategy for controlling nonlinear systems using a learning automaton, A new continuous action-set learning automaton for function optimization, Absorbing stochastic estimator learning automata for S-model stationary environments, A novel technique for stochastic root-finding: enhancing the search with adaptive \(d\)-ary search, The design of absorbing Bayesian pursuit algorithms and the formal analyses of their \(\varepsilon\)-optimality, Stochastic learning-based weak estimation of multinomial random variables and its applications to pattern recognition in non-stationary environments, A learning automata based algorithm for optimization of continuous complex functions, Multi-modal parameter optimization by the automata approach, On ε-Optimality of the Pursuit Learning Algorithm
