Deterministic learning automata solutions to the equipartitioning problem

DOI10.1109/12.75146zbMATH Open0654.68060OpenAlexW1995654107WikidataQ60328314 ScholiaQ60328314MaRDI QIDQ3801077FDOQ3801077

Authors: 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

Recommendations

• Graph partitioning using learning automata
• On using learning automata for fast graph partitioning
• An asymptotically exact polynomial algorithm for equipartition problems
• scientific article; zbMATH DE number 3876604
• A complete anytime algorithm for number partitioning

zbMATH Keywords

deterministic learning automata

Mathematics Subject Classification ID

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

Cited In (7)

• A learning automata-based algorithm for determination of the number of hidden units for three-layer neural networks
• On using learning automata for fast graph partitioning
• An introduction to learning automata and optimization
• Learning based approach for optimal clustering of distributed program's call flow graph
• Graph partitioning using learning automata
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801077)