In this paper, a combination of interval type-2 fuzzy system (IT2FS) models and simulated annealing are used to predict the Mackey-Glass time series by searching for the best configuration of the IT2FS. Simulated annealing is used to optimise the parameters of the antecedent and the consequent parts of the rules for a Mamdani model. Simulated annealing is combined with a method to reduce the co...

We describe an end-to-end real-time S&P futures trading system. Inner-shell stochastic nonlinear dynamic models are developed, and canonical momenta indicators are derived from a fitted Lagrangian used by outer-shell trading models dependent on these indicators. Recursive and adaptive optimization using adaptive simulated annealing is used for fitting parameters shared across these shells of dy...

We present a method to speed up the computation of a high-quality data-dependent triangulation approximating an image using simulated annealing by probability distributions guided by local approximation error and its variance. The triangulation encodes the image, yielding compression rates comparable to or even superior to JPEG and JPEG2000 compression. The specific contributions of our paper a...

This paper discusses design and comparison of Simulated Annealing Algorithm and Greedy Randomized Adaptive Search Procedure (GRASP) to minimize the makespan in scheduling n single operation independent jobs on m unrelated parallel machines. This problem of minimizing the makespan in single machine scheduling problem with uniform parallel machines is NP hard. Hence, heuristic development for suc...

mutual information (mi) is a widely used similarity metric for multimodality image registration. however, it involves an extremely high computational time especially when it is applied to volume images. moreover, its robustness is affected by existence of local maxima. the multi-resolution pyramid approaches have been proposed to speed up the registration process and increase the accuracy of th...

With several commercial tools becoming available, the high-level synthesis of applicationspeci c integrated circuits is nding wide spread acceptance in VLSI industry today. Existing tools for synthesis focus on optimizing cost while meeting performance constraints or vice versa. Yet, veri cation and testing have emerged as major concerns of IC vendors since the repurcussions of chips being reca...

The acceptance-probability-controlled simulated annealing with an adaptive move generation procedure, an optimization technique derived from the simulated annealing algorithm, is presented. The adaptive move generation procedure was compared against the random move generation procedure on seven multiminima test functions, as well as on the synthetic data, resembling the optical constants of a m...

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.A simulated annealing algorithm for the clustering problem. The solution of the clustering problem usually solved by the K-means algorithm.In this paper, we explore the applicability of simulated annealing. Clustering problem is investigat...

In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at the university level. We have investigated a variety of approaches based on simulated annealing, including mean-field annealing, simulated annealing with three different cooling schedules, and the use of a rule-based preprocessor to provide a good initial solution for annealing. The best results w...