Results 271 to 280 of about 2,844,778 (299)
Some of the next articles are maybe not open access.
Identifying algorithmic vulnerabilities through simulated annealing
Optimization Letters, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. Andrew Johnson +2 more
openaire +2 more sources
Simulated annealing algorithms: an overview
IEEE Circuits and Devices Magazine, 1989A brief introduction is given to the actual mechanics of simulated annealing, and a simple example from an IC layout is used to illustrate how these ideas can be applied. The complexities and tradeoffs involved in attacking a realistically complex design problem are illustrated by dissecting two very different annealing algorithms for VLSI chip ...
openaire +1 more source
A nested simulated annealing algorithm
Journal of Statistical Computation and Simulation, 1995The paper describes a new nested simulated annealing algorithm which is a modification of the usual simulated annealing algorithm. In the nested algorithm super-cooling phases are introduced into the normal annealing process, to speed up the evolution of good solutions.
openaire +1 more source
Parallel algorithms for chip placement by simulated annealing
IBM Journal of Research and Development, 1987We explore modifications to the standard simulated annealing method for circuit placement which make it more suitable for use on a shared-memory parallel computer. By employing chaotic approaches we allow the parallel algorithms to deviate from the algorithm defined for a serial computer and thus obtain good execution efficiencies for large numbers of ...
Frederica Darema +2 more
openaire +2 more sources
Three Parallel Algorithms for Simulated Annealing
2002A vehicle routing problem which reduces to an NP-complete set-partitioning problem is considered. Three parallel algorithms for simulated annealing, i.e. the independent, semi-independent and co-operating searches are investigated. The objective is to improve the accuracy of solutions to the problem by applying parallelism.
openaire +1 more source
On the convergence of stationary distributions in simulated annealing algorithms
Information Processing Letters, 1988Simulated annealing is an iterative probabilistic algorithm designed to find good solutions for discrete optimization problems. At each iterative step a deterioration of the objective function is accepted with a certain probability. This probability depends upon a parameter t called the temperature and approaches zero as t approaches zero. Thus optimal
Ulrich Faigle, Rainer Schrader
openaire +1 more source
Genetic algorithms and simulated annealing: a marriage proposal
IEEE International Conference on Neural Networks, 2002Genetic algorithms (GAs) and simulated annealing (SA) have emerged as the leading methodologies for search and optimization problems in high dimensional spaces. A simple scheme of using simulated-annealing mutation (SAM) and recombination (SAR) as operators use the SA stochastic acceptance function internally to limit adverse moves.
openaire +2 more sources
Analysis of simulated annealing type algorithms.
1987Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1987. ; MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING ; Bibliography: leaves 101-103. ; by Saul B. Gelfand. ; Ph.D.
openaire +1 more source
Simulated Annealing Genetic Algorithm for Surface Intersection
2005The paper integrated genetic algorithm and marching method into a novel algorithm to solve the surface intersection problem. By combining genetic algorithm with local searching method the efficiency of evolution is greatly improved. By fully utilizing the global searching ability and instinct attribute for parallel computation of genetic algorithm and ...
Min Tang 0001, Jinxiang Dong
openaire +1 more source
Genetic algorithms and simulated annealing
2009Many applications require either the maximisation or minimisation of a function. For example, in many fields of theoretical physics, a sum of least squares must be minimised, or the energy of a system must be minimised. Many of the standard numerical techniques which exist for the optimisation of functions apply to functions which can be specified in a
openaire +1 more source