Sciweavers

491 search results - page 3 / 99
» A Fast KNN Algorithm Based on Simulated Annealing
Sort
View
ICASSP
2010
IEEE
13 years 8 months ago
Optimized intrinsic dimension estimator using nearest neighbor graphs
We develop an approach to intrinsic dimension estimation based on k-nearest neighbor (kNN) distances. The dimension estimator is derived using a general theory on functionals of k...
Kumar Sricharan, Raviv Raich, Alfred O. Hero III
AE
2005
Springer
14 years 1 months ago
Memetic Algorithms for the MinLA Problem
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA ...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
CORR
2004
Springer
153views Education» more  CORR 2004»
13 years 7 months ago
Cauchy Annealing Schedule: An Annealing Schedule for Boltzmann Selection Scheme in Evolutionary Algorithms
Abstract-Boltzmann selectionis an important selection mechanism in evolutionary algorithms as it has theoretical properties which help in theoretical analysis. However, Boltzmann s...
Ambedkar Dukkipati, M. Narasimha Murty, Shalabh Bh...
ICIC
2007
Springer
14 years 2 months ago
An Improved Nested Partitions Algorithm Based on Simulated Annealing in Complex Decision Problem Optimization
: - This paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of ...
Yan Luo, Changrui Yu
WSC
2004
13 years 9 months ago
A Meta-Heuristic Based on Simulated Annealing for Solving Multiple-Objective Problems in Simulation Optimization
This paper presents a new meta heuristic algorithm based on the search method called simulated annealing, and its application to solving multi objective simulation optimization pr...
Eduardo Alberto Avello, Felipe F. Baesler, Reinald...