Sciweavers

9 search results - page 1 / 2
» Simulated Annealing with Opposite Neighbors
Sort
View
FOCI
2007
IEEE
14 years 5 months ago
Simulated Annealing with Opposite Neighbors
— This paper presents an improvement to the vanilla version of the simulated annealing algorithm by using opposite neighbors. This new technique, is based on the recently propose...
Mario Ventresca, Hamid R. Tizhoosh
DMIN
2007
214views Data Mining» more  DMIN 2007»
14 years 7 days ago
A Fast KNN Algorithm Based on Simulated Annealing
K-Nearest Neighbor is used broadly in text classification, but it has one deficiency—computational efficiency. In this paper, we propose a heuristic search way to find out the k ...
Chuanyao Yang, Yuqin Li, Chenghong Zhang, Yunfa Hu
ICIP
2009
IEEE
14 years 12 months ago
Improved Global Cardiac Tractography With Simulated Annealing
We propose a new fibre tracking algorithm for cardiac DTMRI that parts with the locally "greedy" paradigm intrinsic to conventional tracking algorithms. We formulate the...
ML
2007
ACM
192views Machine Learning» more  ML 2007»
13 years 10 months ago
Annealing stochastic approximation Monte Carlo algorithm for neural network training
We propose a general-purpose stochastic optimization algorithm, the so-called annealing stochastic approximation Monte Carlo (ASAMC) algorithm, for neural network training. ASAMC c...
Faming Liang
CEC
2008
IEEE
14 years 5 months ago
A feasibility-preserving local search operator for constrained discrete optimization problems
Abstract— Meta-heuristic optimization approaches are commonly applied to many discrete optimization problems. Many of these optimization approaches are based on a local search op...
Martin Lukasiewycz, Michael Glaß, Christian ...