| Autor: |
Aarts, Emile H. L., Korst, Jan H. M. |
| Zdroj: |
Algorithmica; June 1991, Vol. 6 Issue: 1-6 p437-465, 29p |
| Abstrakt: |
The potential of Boltzmann machines to cope with difficult combinatorial optimization problems is investigated. A discussion of various (parallel) models of Boltzmann machines is given based on the theory of Markov chains. A general strategy is presented for solving (approximately) combinatorial optimization problems with a Boltzmann machine. The strategy is illustrated by discussing the details for two different problems, namely MATCHING and GRAPH PARTITIONING. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
Full text from SpringerLink