Graph partitioning using learning automata

DOI10.1109/12.485372zbMath1068.68676OpenAlexW2146350180WikidataQ60328152 ScholiaQ60328152MaRDI QIDQ4420896

B. John Oommen, Edward V. de st. Croix

Publication date: 10 November 2003

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

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

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items (13)

Achieving Unbounded Resolution inFinitePlayer Goore Games Using Stochastic Automata, and Its Applications ⋮ A MATHEMATICAL FRAMEWORK FOR CELLULAR LEARNING AUTOMATA ⋮ On using learning automata for fast graph partitioning ⋮ OPEN SYNCHRONOUS CELLULAR LEARNING AUTOMATA ⋮ Asynchronous cellular learning automata ⋮ A formal analysis of why heuristic functions work ⋮ Finding optimal solutions to the graph partitioning problem with heuristic search ⋮ A learning automata-based algorithm for determination of the number of hidden units for three-layer neural networks ⋮ CELLULAR LEARNING AUTOMATA BASED DYNAMIC CHANNEL ASSIGNMENT ALGORITHMS ⋮ Unnamed Item ⋮ A new continuous action-set learning automaton for function optimization ⋮ UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS ⋮ The design of absorbing Bayesian pursuit algorithms and the formal analyses of their \(\varepsilon\)-optimality

This page was built for publication: Graph partitioning using learning automata