scholar.google.com › citations
In this paper, we describe two parallel implementations of the simulated annealing method applied to the shape detection problem.
Simulated annealing is a powerful stochastic technique for solving combinatorial optimization problems. It differs from other techniques based on iterative ...
PARALLEL SIMULATED ANNEALING FOR SHAPE DETECTION. Another interesting ... PARALLEL SIMULATED ANNEALING FOR SHAPE DETECTION k small shapes tend to increase the ...
Simulated annealing is a powerful stochastic technique for solving combinatorial opti- mization problems. It differs from other techniques based on ...
The main focus of the paper is on restructuring the basic simulated annealing algorithm to execute on a multiprocessor, and how to select appropriate sets ...
People also ask
Which types of problems are suitable to solve using simulated annealing method?
Which one of the following is a disadvantage of simulated annealing method?
What is simulated annealing good for?
What is the difference between simulated annealing and dual annealing?
Jan 11, 1995 · Parallel simulated annealing for shape detection. Authors: Author ... Parallel simulated annealing for shape detection. Computer systems ...
Feb 12, 2024 · Development and evaluation of parallel simulated annealing algorithm for reactor core optimization problems · Abstract · Keywords · Introduction.
Missing: Detection. | Show results with:Detection.
This paper presents a parallel simulated annealing algorithm that is able to achieve 90% parallel efficiency in iteration on up to 192 processors and up to ...
Missing: Shape Detection.
The purpose of this study is to investigate the feasibility of using a simulated annealing algorithm in conjunction with a simulation model to find the optimal ...
images of large areas under a wide range of operating conditions. The ability to recognize targets automatically in SAR images is therefore highly desirable ...