Combinatorial optimization by stochastic automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3427224 (Why is no real title available?)
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 3519671 (Why is no real title available?)
- scientific article; zbMATH DE number 3359804 (Why is no real title available?)
- scientific article; zbMATH DE number 3059214 (Why is no real title available?)
- scientific article; zbMATH DE number 3109895 (Why is no real title available?)
- Absolutely Expedient Learning Algorithms for Stochastic Automata
- Automaton theory and modelling of biological systems. Translated by Scitran (Scientific Translation Service)
- Convergence and finite-time behavior of simulated annealing
- Discrete Optimizing
- Intersection theorems in permutation groups
- Learning Automata - A Survey
- Nonstationary Markov chains and convergence of the annealing algorithm
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Optimization by simulated annealing
- Simulated annealing methods with general acceptance probabilities
- Some Metrical Problems on Sn
- Use of Stochastic Automata for Parameter Self-Optimization with Multimodal Performance Criteria
This page was built for publication: Combinatorial optimization by stochastic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750309)