Results 221 to 230 of about 48,275 (260)
Some of the next articles are maybe not open access.
Random Structures & Algorithms, 1992
AbstractThis article introduces the notion of restricted parallelism for networks, a generalization of the unlimited parallelism for Boltzmann machines. The convergence of the annealing algorithm in the restricted parallel form is established, for an arbitrary network.
openaire +1 more source
AbstractThis article introduces the notion of restricted parallelism for networks, a generalization of the unlimited parallelism for Boltzmann machines. The convergence of the annealing algorithm in the restricted parallel form is established, for an arbitrary network.
openaire +1 more source
Optimization by Simulated Annealing
Science, 1983There is a deep and useful connection between statistical mechanics (the behavior of systems with many degrees of freedom in thermal equilibrium at a finite temperature) and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters).
Scott Kirkpatrick +2 more
openaire +2 more sources
SIMULATED ANNEALING AND OPTIMAL PROTOCOLS
Journal of Circuits, Systems and Computers, 2009Many human tumors cannot easily be avoided. In most cases a prophylactic vaccination prevents the tumor growth. In particular the Triplex vaccine prevented mammary carcinoma formation using a Chronic schedule, but it is not known if this schedule is minimal. A computational model named SimTriplex was able to reproduce in silico the in vivo experiments.
Marzio Pennisi +5 more
openaire +3 more sources
Optimization and Engineering, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Simulated Annealing In Crystallography
Annual Review of Physical Chemistry, 1991X-ray crystallography (see Refs. 1 , 2 for reviews) is an increasingly impor tant tool for understanding structure, function, and control of biological macromolecules. Developments in genetics, data collection, and computer hardware have produced an unprecedented growth of macromolecular crystallographic studies.
openaire +1 more source
Proceedings of the 2012 ACM international symposium on International Symposium on Physical Design, 2012
Simulated annealing was first introduced in 1983 as a generic stochastic algorithmic approach to solve optimization problems. Prof. C. L. Liu and his students H. W. Leong and D. F. Wong were among the earliest EDA researchers who applied simulated annealing to EDA.
openaire +1 more source
Simulated annealing was first introduced in 1983 as a generic stochastic algorithmic approach to solve optimization problems. Prof. C. L. Liu and his students H. W. Leong and D. F. Wong were among the earliest EDA researchers who applied simulated annealing to EDA.
openaire +1 more source
American Journal of Mathematical and Management Sciences, 1988
SYNOPTIC ABSTRACTThe principal shortcoming of simulated annealing (SA) is that it takes too much computer time. We present a few “swindling” ideas for speeding up SA by simulating its action on a problem. The increase in speed is attained at the cost of decreasing generality — the methods all require the use of problem-specific information.
openaire +1 more source
SYNOPTIC ABSTRACTThe principal shortcoming of simulated annealing (SA) is that it takes too much computer time. We present a few “swindling” ideas for speeding up SA by simulating its action on a problem. The increase in speed is attained at the cost of decreasing generality — the methods all require the use of problem-specific information.
openaire +1 more source
SPECT reconstruction by simulated annealing
Physics in Medicine and Biology, 1989The technique of simulated annealing has been introduced for reconstruction in single photon emission computed tomography (SPECT) of data from rotating gamma camera systems. This is a much used technique in fields other than medical imaging but has only been used for one previous medical imaging application by Barrett et al (1983). It is shown that for
openaire +2 more sources
Cheaper Jacobians by Simulated Annealing
SIAM Journal on Optimization, 2002The author applies simulated annealing to the vertex elimination problem In linearized c-graphs for generating nearly optimal Jacobian code.
openaire +2 more sources
Experiments with simulated annealing
Proceedings of the 22nd ACM/IEEE conference on Design automation - DAC '85, 1985Surendra Nahar +2 more
openaire +1 more source