Deterministic learning automata solutions to the equipartitioning problem

DOI10.1109/12.75146zbMath0654.68060OpenAlexW1995654107WikidataQ60328314 ScholiaQ60328314MaRDI QIDQ3801077

B. John Oommen, Daniel C. Y. Ma

Publication date: 1988

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.75146

zbMATH Keywords

deterministic learning automata

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Information storage and retrieval of data (68P20)

Related Items (5)

On using learning automata for fast graph partitioning ⋮ A learning automata-based algorithm for determination of the number of hidden units for three-layer neural networks ⋮ An Introduction to Learning Automata and Optimization ⋮ A Memetic Model Based on Fixed Structure Learning Automata for Solving NP-Hard Problems ⋮ The Applications of Object Migration Automaton (OMA)-Memetic Algorithm for Solving NP-Hard Problems

This page was built for publication: Deterministic learning automata solutions to the equipartitioning problem