Abstract
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. © Springer-Verlag Berlin Heidelberg 2001.
Cite
CITATION STYLE
Salcedo, F. J., Ortega, J., & Prieto, A. (2001). Analyzing boltzmann machine parameters for fast convergence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2085 LNCS, pp. 144–151). Springer Verlag. https://doi.org/10.1007/3-540-45723-2_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
