Results 291 to 300 of about 2,996,453 (335)
Some of the next articles are maybe not open access.
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
Solar Energy, 2018
Small reverse osmosis (RO) based desalination plants driven by wind and solar energies are attractive options to meet the requirements of autonomous areas.
Guozhao Zhang +3 more
semanticscholar +1 more source
Small reverse osmosis (RO) based desalination plants driven by wind and solar energies are attractive options to meet the requirements of autonomous areas.
Guozhao Zhang +3 more
semanticscholar +1 more source
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 +5 more sources
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 +2 more sources
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 +2 more sources
Dynamic path planning of mobile robot based on improved simulated annealing algorithm
Journal of the Franklin Institute, 2023Kun Shi +3 more
semanticscholar +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
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
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
Operations Research, 1989Catherine Schevon, David S Johnson
exaly