Graph partitioning using learning automata
From MaRDI portal
Publication:4420896
Recommendations
- On using learning automata for fast graph partitioning
- Deterministic learning automata solutions to the equipartitioning problem
- New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation
- scientific article; zbMATH DE number 1418276
- scientific article; zbMATH DE number 3855167
Cited in
(16)- A new continuous action-set learning automaton for function optimization
- The design of absorbing Bayesian pursuit algorithms and the formal analyses of their \(\varepsilon\)-optimality
- Asynchronous cellular learning automata
- A formal analysis of why heuristic functions work
- Finding optimal solutions to the graph partitioning problem with heuristic search
- Achieving Unbounded Resolution inFinitePlayer Goore Games Using Stochastic Automata, and Its Applications
- Cellular learning automata based dynamic channel assignment algorithms
- UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS
- OPEN SYNCHRONOUS CELLULAR LEARNING AUTOMATA
- A learning automata-based algorithm for determination of the number of hidden units for three-layer neural networks
- Deterministic learning automata solutions to the equipartitioning problem
- Finding part-machine families using graph partitioning techniques
- Learning based approach for optimal clustering of distributed program's call flow graph
- On using learning automata for fast graph partitioning
- A MATHEMATICAL FRAMEWORK FOR CELLULAR LEARNING AUTOMATA
- scientific article; zbMATH DE number 2230218 (Why is no real title available?)
This page was built for publication: Graph partitioning using learning automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4420896)