Results 241 to 250 of about 929,584 (264)
Some of the next articles are maybe not open access.
On Simulated Annealing and Nested Annealing
Journal of Global Optimization, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2016
Metaheuristics exhibit desirable properties like simplicity, easy parallelizability, and ready applicability to different types of optimization problems. After a comprehensive introduction to the field, the contributed chapters in this book include explanations of the main metaheuristics techniques, including simulated annealing, tabu search ...
openaire +2 more sources
Metaheuristics exhibit desirable properties like simplicity, easy parallelizability, and ready applicability to different types of optimization problems. After a comprehensive introduction to the field, the contributed chapters in this book include explanations of the main metaheuristics techniques, including simulated annealing, tabu search ...
openaire +2 more sources
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
Generalized deterministic annealing
IEEE Transactions on Neural Networks, 1996We develop a general formalism for computing high quality, low-cost solutions to nonconvex combinatorial optimization problems expressible as distributed interacting local constraints. For problems of this type, generalized deterministic annealing (GDA) avoids the performance-related sacrifices of current techniques.
S T, Acton, A C, Bovik
openaire +2 more sources
Quantum Probability and Infinite Dimensional Analysis, 2010
In the evolution of a quantum system subject to a nonlinear dissipative term of Kostin type the probability amplitudes associated to excited states of the Hamiltonian are damped; this results in a dynamic convergence toward the ground state. In this paper we dicuss how dissipation can replace adiabatic evolution in the search of the ground state of a ...
D. De Falco, E. Pertoso, D. Tamascelli
openaire +2 more sources
In the evolution of a quantum system subject to a nonlinear dissipative term of Kostin type the probability amplitudes associated to excited states of the Hamiltonian are damped; this results in a dynamic convergence toward the ground state. In this paper we dicuss how dissipation can replace adiabatic evolution in the search of the ground state of a ...
D. De Falco, E. Pertoso, D. Tamascelli
openaire +2 more sources
1989
The goal of the research out of which this monograph grew, was to make annealing as much as possible a general purpose optimization routine. At first glance this may seem a straight-forward task, for the formulation of its concept suggests applicability to any combinatorial optimization problem.
Otten, R.H.J.M., Ginneken, van, L.P.P.P.
openaire +2 more sources
The goal of the research out of which this monograph grew, was to make annealing as much as possible a general purpose optimization routine. At first glance this may seem a straight-forward task, for the formulation of its concept suggests applicability to any combinatorial optimization problem.
Otten, R.H.J.M., Ginneken, van, L.P.P.P.
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
Annealing Macromolecular Crystals
2006The process of crystal annealing has been used to improve the quality of diffraction from crystals that would otherwise be discarded for displaying unsatisfactory diffraction after flash cooling. Although techniques and protocols vary, macromolecular crystals are annealed by warming the flash-cooled crystal, then flash cooling it again.
B Leif, Hanson, Gerard J, Bunick
openaire +2 more sources
Nature, 1948
IT is well known that the relaxation of stress in glass during annealing does not follow the Maxwellian relaxation formula. Indeed, annealing schedules for glass are always based on Adams and Williamson‘s1empirical law that the reciprocal of the stress is proportional to the time.
openaire +2 more sources
IT is well known that the relaxation of stress in glass during annealing does not follow the Maxwellian relaxation formula. Indeed, annealing schedules for glass are always based on Adams and Williamson‘s1empirical law that the reciprocal of the stress is proportional to the time.
openaire +2 more sources