Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,589,876 papers from all fields of science
Search
Sign In
Create Free Account
Simulated annealing
Known as:
SA
, Simulated annealling
, Generalized simulated annealing
Expand
Simulated annealing (SA) is a probabilistic technique for approximating the global optimum of a given function. Specifically, it is a metaheuristic…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Ant colony optimization algorithms
Boltzmann machine
Cladogram
Crystal structure prediction
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Genetic simulated annealing algorithm for task scheduling based on cloud computing environment
Guo-ning Gan
,
Ting-lei Huang
,
Shuai Gao
International Conference on Intelligent Computing…
2010
Corpus ID: 8400860
Scheduling is a very important part of the cloud computing system. This paper introduces an optimized algorithm for task…
Expand
Review
2009
Review
2009
Recent Progress in Polymer Solar Cells: Manipulation of Polymer:Fullerene Morphology and the Formation of Efficient Inverted Polymer Solar Cells
Li‐Min Chen
,
Z. Hong
,
Gang Li
,
Yang Yang
2009
Corpus ID: 53138575
Polymer morphology has proven to be extremely important in determining the optoelectronic properties in polymer‐based devices…
Expand
2009
2009
Using Simulated Annealing for Task Scheduling in Distributed Systems
M. H. Kashani
,
M. Jahanshahi
International Conference on Computational…
2009
Corpus ID: 16980550
Task scheduling is one of the key factors in a distributed system. That is, how proper allocating the tasks to the processor of…
Expand
Highly Cited
2006
Highly Cited
2006
Robot Path Planning Based on Artificial Potential Field Approach with Simulated Annealing
Qidan Zhu
,
Yongjie Yan
,
Zhuoyi Xing
Sixth International Conference on Intelligent…
2006
Corpus ID: 9833051
The artificial potential field (APF) approach provides a simple and effective motion planning method for practical purpose…
Expand
Highly Cited
2002
Highly Cited
2002
Using simulated annealing for resource allocation
J. Aerts
,
G. Heuvelink
International Journal of Geographical Information…
2002
Corpus ID: 7518034
Many resource allocation issues, such as land use- or irrigation planning, require input from extensive spatial databases and…
Expand
Highly Cited
1999
Highly Cited
1999
Phase balancing using simulated annealing
J. Zhu
,
G. Bilbro
,
M. Chow
1999
Corpus ID: 40548267
Deregulation eliminates the boundary of the territory of the monopoly power industry. Competition forces utilities to improve…
Expand
Highly Cited
1998
Highly Cited
1998
Fitting models predicting dates of flowering of temperate‐zone trees using simulated annealing
I. Chuine
,
P. Cour
,
D. Rousseau
1998
Corpus ID: 18816155
The aim of the present study was to test the four commonly used models to predict the dates of flowering of temperatezone trees…
Expand
Highly Cited
1997
Highly Cited
1997
DYNAMIC FINITE ELEMENT MODEL UPDATING USING SIMULATED ANNEALING AND GENETIC ALGORITHMS
R. Levin
,
N. Lieven
1997
Corpus ID: 14187277
Abstract Dynamic finite element (FE) model updating may be considered as an optimisation process. Over the past few years, two…
Expand
Highly Cited
1995
Highly Cited
1995
Bayesian Learning for Neural Networks
Radford M. Neal
1995
Corpus ID: 60809283
Artificial "neural networks" are widely used as flexible models for classification and regression applications, but questions…
Expand
Highly Cited
1993
Highly Cited
1993
Channel assignment for cellular radio using simulated annealing
M. Duque-Antón
,
D. Kunz
,
B. Ruber
1993
Corpus ID: 61165359
The channel assignment problem, i.e. the task of assigning the channels to the radio base stations in a spectrum-efficient way…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE