Results 251 to 260 of about 122,614 (295)
Some of the next articles are maybe not open access.
A simulated annealing algorithm for the clustering problem
Pattern Recognition, 1991Abstract In this paper we discuss the solution of the clustering problem usually solved by the K -means algorithm. The problem is known to have local minimum solutions which are usually what the K -means algorithm obtains. The simulated annealing approach for solving optimization problems is described and is proposed for solving the clustering ...
Shokri Z. Selim, K. Alsultan
openaire +1 more source
Parallel Simulated Annealing Algorithms in Global Optimization
Journal of Global Optimization, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Esin Onbasçioglu, Linet Özdamar
openaire +2 more sources
Combining the Perceptron Algorithm with Logarithmic Simulated Annealing
Neural Processing Letters, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreas Alexander Albrecht, C. K. Wong
openaire +2 more sources
Truss Optimization using the Simulated Annealing Algorithm
Proceedings of the 10th International Conference on Information Systems and Technologies, 2020This document presents the results of our work aiming to create a tool for generating trusses. The generated structures undergo an optimizing process to be in the best possible form. The automatic generation of the truss structure is done using an algorithm adapted to the type of an initial design domain.
Zineb Biallaten +2 more
openaire +1 more source
A Fast Algorithm for Simulated Annealing
Physica Scripta, 1991We present a new deterministic algorithm for simulated annealing and demonstrate its applicability with several classical examples: the ground state energies of the 2d and 3d short range Ising spin glasses, the traveling salesman problem, and pattern recognition in computer vision.
Hong Guo +3 more
openaire +1 more source
New simulated annealing algorithms
Proceedings of 1997 IEEE International Symposium on Circuits and Systems. Circuits and Systems in the Information Age ISCAS '97, 2002This paper introduces a new class of D-dimensional density probability functions to be used in Simulated Annealing algorithms and derives an appropriate cooling schedule that is proved to be inversely proportional to a previously chosen power n of time.
P.R.S. Mendonca, L.P. Caloba
openaire +1 more source
The Simulated Annealing Algorithm
1988Most placement and global routing problems belong to the class of NP-complete problems.1 For problems in this class, there is no known exact algorithm whose worst-case time complexity is bounded by a polynomial in the size of the input. Consequently, heuristic algorithms are used to find solutions to these problems.
openaire +1 more source
Implementing a Parallel Simulated Annealing Algorithm
2010The MPI and OpenMP implementations of the parallel simulated annealing algorithm solving the vehicle routing problem (VRPTW) are presented. The algorithm consists of a number of components which co-operate periodically by exchanging their best solutions found to date.
Zbigniew J. Czech +2 more
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 +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