Analyzing Boltzmann Machine Parameters for Fast Convergence
The behavior of a Boltzmann Machine (BM) according to changes in the parameters that determine its convergence is experimentally analyzed to find a way to accelerate the convergence towards a solution for the given optimization problem. The graph colouring problem has been chosen as a benchmark for which convergence with quadratic time complexity has been obtained.
Unable to display preview. Download preview PDF.
- 2.Chow, F., Hennessy, J.: Register Allocation by Priority-Based Colouring. Proceedings of the ACM SIGPLAN’ 84. Symposium on Compiler Construction SIGPLAN Notices, vol. 19,num.6, (June 1984)Google Scholar
- 5.Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NPCompleteness. Freeman (1979)Google Scholar
- 6.Zissimopoulos, V., Paschos, V.Th., Pekergin, F.:On the Approximation of NP-Complete Problems by Using the Bolzmann Machine Method: The Cases of Some Covering and Packing Problems. IEEE Transactions on Computers, vol. 40,num. 12, (December 1991)Google Scholar