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
Parallel Simulated Annealing Algorithms
β Scribed by D.Janaki Ram; T.H. Sreenivas; K.Ganapathy Subramaniam
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 195 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
Unfortunately due to a technical error the author's name appeared incorrectly in the author index, 77 (1997) 307-308, as Manuel, D.-A. instead of Duque-Ant&, M.
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
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