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
β¦ LIBER β¦
A simulated annealing algorithm for the clustering problem
β Scribed by Shokri Z. Selim; K. Alsultan
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 497 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Simulated Annealing Clusterization Algor
β
Rajeev K. Puri; Joerg Aichelin
π
Article
π
2000
π
Elsevier Science
π
English
β 370 KB
A simulated annealing based algorithm fo
β
Mihir Arjunwadkar; D.G. Kanhere
π
Article
π
1991
π
Elsevier Science
π
English
β 655 KB
A global algorithm for the fuzzy cluster
β
Khaled S Al-Sultan; Shokri Z Selim
π
Article
π
1993
π
Elsevier Science
π
English
β 382 KB
A combined algorithm for weighting the v
β
Vladimir J. Lumelsky
π
Article
π
1982
π
Elsevier Science
π
English
β 554 KB
Mixture decomposition via the simulated
β
Ingrassia, S.
π
Article
π
1991
π
John Wiley and Sons
π
English
β 481 KB
## Abstract This paper presents the problem of the evaluation of the maximum likelihood estimator, when the likelihood function has multiple maxima, using the stochastic algorithm called βsimulated annealingβ. Analysis of the particular case of the decomposition of a mixture of five univariate norm
A method for optimizing programmable log
β
J.M. SΓ‘nchez; J. Ballesteros
π
Article
π
1995
π
Elsevier Science
π
English
β 833 KB