We determine the optimal ensemble size for a simulated annealing problem based on assumptions about scaling properties of the system dynamics and of the density of states in the low energy regime. The derivations indicate the optimal annealing time for any one ensemble member, thereby providing a st
Parallel implementation of simulated annealing using transaction processing
โ Scribed by Pao, D.C.W.; Lam, S.P.; Fong, A.S.
- Book ID
- 114448368
- Publisher
- The Institution of Electrical Engineers
- Year
- 1999
- Tongue
- English
- Weight
- 620 KB
- Volume
- 146
- Category
- Article
- ISSN
- 1350-2387
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We describe an application of distributed processing to approximating the solution to certain NP-complete problems in Combinatorial Optimization. The basic technique employed is known as Simulated Annealing and consists of a stochastic search inspired in the principles of Statistical Physics. A wide
We report the results of testing the performance of a new, efficient, and highly general-purpose parallel optimization method, based upon simulated annealing. This optimization algorithm was applied to analyze the network of interacting genes that control embryonic development and other fundamental