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

Comparison of vector and parallel implementations of the simulated annealing algorithm

โœ Scribed by J.M. Voogd; P.M.A. Sloot; R.v. Dantzig

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
793 KB
Volume
11
Category
Article
ISSN
0167-739X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Optimization of job scheduling on parall
Optimization of job scheduling on parallel machines by simulated annealing algorithms
โœ Zhen-Ping Lo; B. Bavarian ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 536 KB

ln this paper, we consider the problem of scheduling a set of simultaneously available jobs on several parallel machines. Specifically, the minimization of the time to finish all the jobs assigned to all machines under job deadline constraints for n jobs, m machines problem is formulated in this pap