Deterministic learning automata solutions to the equipartitioning problem
From MaRDI portal
Publication:3801077
Recommendations
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)