๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parallel Simulated Annealing for Shape Detection

โœ Scribed by G. Bongiovanni; P. Crescenzi; C. Guerra

Book ID
112241363
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
960 KB
Volume
61
Category
Article
ISSN
1077-3142

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Parallel Simulated Annealing Algorithms
Parallel Simulated Annealing Algorithms
โœ D.Janaki Ram; T.H. Sreenivas; K.Ganapathy Subramaniam ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 195 KB
Parallel simulated annealing for structu
Parallel simulated annealing for structural optimization
โœ J.P.B. Leite; B.H.V. Topping ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 391 KB

The simulated annealing (SA) algorithm has proven to be a good technique for solving dicult combinatorial optimization problems. In engineering optimization the SA has emerged as an alternative tool to solve problems which are dicult to solve by conventional mathematical programming techniques. The

A parallel simulated annealing algorithm
A parallel simulated annealing algorithm
โœ Nicolas Boissin; Jean-Luc Lutton ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 752 KB
Optimal ensemble size for parallel imple
Optimal ensemble size for parallel implementations of simulated annealing
โœ Karl Heinz Hoffmann; Paolo Sibani; Jacob M. Pedersen; Peter Salamon ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 324 KB

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