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

A segmented algorithm for simulated annealing

โœ Scribed by A. C. Atkinson

Publisher
Springer US
Year
1992
Tongue
English
Weight
705 KB
Volume
2
Category
Article
ISSN
0960-3174

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A stepwise-overlapped parallel simulated
A stepwise-overlapped parallel simulated annealing algorithm
โœ Youngtak Kim; Myunghwan Kim ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 937 KB

This paper proposes a parallel annealing algorithm, called stepwise-overlapped annealing, that can be efficiently implemented to a multiprocessor system with a large number of processors such as hypercube computers. It is an improved aigorithm of the systolic annealing that was ,proposed by Aarts et

Simulated Annealing Clusterization Algor
Simulated Annealing Clusterization Algorithm for Studying the Multifragmentation
โœ Rajeev K. Puri; Joerg Aichelin ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 370 KB

We here present the details of the numerical realization of the recently advanced algorithm developed to identify the fragmentation in heavy ion reactions. This new algorithm is based on the simulated annealing method and is dubbed the simulated annealing clusterization algorithm (SACA). We discuss

Adaptive simulated annealing genetic alg
Adaptive simulated annealing genetic algorithm for system identification
โœ Il-kwon Jeong; Ju-jang Lee ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 757 KB

Genetic algorithms and simulated annealing are leading methods of search and optimization. This paper proposes an efficient hybrid genetic algorithm named ASAGA (Adaptive Simulated Annealing Genetic Algorithm). Genetic algorithms are global search techniques for optimization. However, they are poor