z-logo
Premium
Parallel simulated annealing
Author(s) -
Mazza Christian
Publication year - 1992
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.3240030204
Subject(s) - parallel computing , parallelism (grammar) , simulated annealing , computer science , generalization , convergence (economics) , data parallelism , algorithm , theoretical computer science , mathematics , mathematical analysis , economics , economic growth
This article introduces the notion of restricted parallelism for networks, a generalization of the unlimited parallelism for Boltzmann machines. The convergence of the annealing algorithm in the restricted parallel form is established, for an arbitrary network.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here