Results 211 to 220 of about 48,275 (260)
Some of the next articles are maybe not open access.
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2010
We present a new class of methods for the global optimization of continuous variables based on simulated annealing (SA). The coupled SA (CSA) class is characterized by a set of parallel SA processes coupled by their acceptance probabilities. The coupling is performed by a term in the acceptance probability function, which is a function of the energies ...
Samuel Xavier de Souza +3 more
openaire +2 more sources
We present a new class of methods for the global optimization of continuous variables based on simulated annealing (SA). The coupled SA (CSA) class is characterized by a set of parallel SA processes coupled by their acceptance probabilities. The coupling is performed by a term in the acceptance probability function, which is a function of the energies ...
Samuel Xavier de Souza +3 more
openaire +2 more sources
Simulated annealing on a multiprocessor
Proceedings 1988 IEEE International Conference on Computer Design: VLSI, 2003The authors present a method for parallelizing the simulated annealing algorithm by mapping the algorithm onto a dynamically structured tree of processors. The resulting parallel simulated annealing algorithm is discussed and its performance evaluated using simulation techniques.
Roger D. Chamberlain +3 more
openaire +1 more source
On Simulated Annealing and Nested Annealing
Journal of Global Optimization, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Simulated annealing — to cool or not
Systems & Control Letters, 1989zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hajek, Bruce, Sasaki, Galen
openaire +2 more sources
Simulated Annealing and Graph Colouring [PDF]
Combinatorics, Probability and Computing, 2001 Simulated annealing is a very successful heuristic for various problems in combinatorial optimization. In this paper an application of simulated annealing to the 3-colouring problem is considered. In contrast to many good empirical results we will show for a certain class of graphs that the expected first hitting time of a proper colouring, given an
Nolte, Andreas, Schrader, Rainer
openaire +3 more sources
On chaotic simulated annealing
IEEE Transactions on Neural Networks, 1998Chen and Aihara recently proposed a chaotic simulated annealing approach to solving optimization problems. By adding a negative self-coupling to a network model proposed earlier by Aihara et al. and gradually removing this negative self-coupling, they used the transient chaos for searching and self-organizing, thereby achieving remarkable improvement ...
Lipo Wang 0001, Kate A. Smith
openaire +2 more sources
SIAM Journal on Optimization, 1995
Summary: By cooling slightly more slowly than the canonical schedule and simulating direct self-loop sequences implicitly, the computer time to execute simulated annealing given the number of accepted moves becomes proportional to that number in expectation and, in a certain sense, almost surely.
openaire +1 more source
Summary: By cooling slightly more slowly than the canonical schedule and simulating direct self-loop sequences implicitly, the computer time to execute simulated annealing given the number of accepted moves becomes proportional to that number in expectation and, in a certain sense, almost surely.
openaire +1 more source
Proceedings of ISCAS'95 - International Symposium on Circuits and Systems, 2002
A simulated annealing algorithm for wire placement is proposed in which annealing is carried out under conditions of constant interconnection pressure rather than constant area. This is achieved by modifying the Metropolis criterion so that changes in the Gibbs free energy of the wires are calculated.
Phillip Christie +2 more
openaire +1 more source
A simulated annealing algorithm for wire placement is proposed in which annealing is carried out under conditions of constant interconnection pressure rather than constant area. This is achieved by modifying the Metropolis criterion so that changes in the Gibbs free energy of the wires are calculated.
Phillip Christie +2 more
openaire +1 more source
Simulated annealing: An introduction
Statistica Neerlandica, 1989Simulated annealing is a general approach for approximately solving large combinatorial optimization problems. The algorithm is based on an intriguing combination of ideas from at first sight completely unrelated fields of science, viz. combinatorial optimization and statistical physics.
Aarts, E.H.L., Laarhoven, van, P.J.M.
openaire +2 more sources
Optimizing simulated annealing
2006This paper reviews efforts towards optimizing simulated annealing. In particular we address the question of the optimal schedule and of how estimates of system properties needed in optimizing simulated annealing can be obtained. We describe the ensemble approach to simulated annealing which lends itself readily to the implementation on parallel and ...
Karl-Heinz Hoffmann 0002 +2 more
openaire +1 more source