ACM Computing Surveys (CSUR)
A Cost Minimization Approach to Edge Detection Using Simulated Annealing
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Markov Random Field Model-Based Approach to Image Interpretation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Parallel Genetic Simulated Annealing: A Massively Parallel SIMD Algorithm
IEEE Transactions on Parallel and Distributed Systems
Generating highly-routable sparse crossbars for PLDs
FPGA '00 Proceedings of the 2000 ACM/SIGDA eighth international symposium on Field programmable gate arrays
A local search approximation algorithm for k-means clustering
Proceedings of the eighteenth annual symposium on Computational geometry
Precoding for Minimization of Envelope Variations in Multicode DS-CDMA Systems
Wireless Personal Communications: An International Journal
Strand design for biomolecular computation
Theoretical Computer Science - Natural computing
Stochastic Local Search Algorithms for DNA Word Design
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
A local search approximation algorithm for k-means clustering
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
Parallel LAN/WAN heuristics for optimization
Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
Linear constructions for DNA codes
Theoretical Computer Science
Improving performance and robustness of domain-specific CPLDs
Proceedings of the 2006 ACM/SIGDA 14th international symposium on Field programmable gate arrays
An evolution-based tabu search approach to codebook design
Pattern Recognition
Iterated local search and constructive heuristics for error correcting code design
International Journal of Innovative Computing and Applications
Improved search strategies and extensions to k-medoids-based clustering algorithms
International Journal of Business Intelligence and Data Mining
Heuristic algorithms for constructing binary constant weight codes
IEEE Transactions on Information Theory
Spherical codes on torus layers
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Image and Vision Computing
Tuning Extended Kalman Filter for Induction Motor drives using simulated annealing
MIC '07 Proceedings of the 26th IASTED International Conference on Modelling, Identification, and Control
Hybrid randomised neighbourhoods improve stochastic local search for DNA code design
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Spherical logarithmic quantization
IEEE Transactions on Audio, Speech, and Language Processing
Index assignment optimization for joint source-channel MAP decoding
IEEE Transactions on Communications
Genetic Programming and Evolvable Machines
Sequence design for MPG QS-CDMA systems based on heuristic combinatorial optimization
Wireless Communications & Mobile Computing
| Hi-index | 754.90 |
Simulated annealing is a computational heuristic for obtaining approximate solutions to combinatorial optimization problems. It is used to construct good source codes, error-correcting codes, and spherical codes. For certain sets of parameters codes that are better than any other known in the literature are found.