Learning Optimal Discriminant Functions through a Cooperative Game of Automata
From MaRDI portal
Publication:3771625
DOI10.1109/TSMC.1987.289334zbMath0633.68047OpenAlexW2023745809MaRDI QIDQ3771625
M. A. L. Thathachar, P. S. Sastry
Publication date: 1987
Published in: IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsmc.1987.289334
Related Items (14)
On ε-Optimality of the Pursuit Learning Algorithm ⋮ Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata ⋮ A hierarchical system of learning automata that can learn the globally optimal path ⋮ Algorithms for Steiner Connected Dominating Set Problem Based on Learning Automata Theory ⋮ Continuous action set learning automata for stochastic optimization ⋮ Using a priori knowledge to create probabilistic models for optimization. ⋮ DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH ⋮ Stochastic automata and learning systems. ⋮ Learning automata algorithms for pattern classification. ⋮ Stochastic approximation algorithms: overview and recent trends. ⋮ A learning automata-based algorithm for determination of the number of hidden units for three-layer neural networks ⋮ A new continuous action-set learning automaton for function optimization ⋮ A LEARNING AUTOMATA-BASED ALGORITHM TO THE STOCHASTIC MIN-DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM ⋮ Absolutely expedient algorithms for learning Nash equilibria
This page was built for publication: Learning Optimal Discriminant Functions through a Cooperative Game of Automata