Sciweavers

370 search results - page 17 / 74
» A Meta-Heuristic Based on Simulated Annealing for Solving Mu...
Sort
View
CIKM
2007
Springer
14 years 1 months ago
Finding and linking incidents in news
News reports are being produced and disseminated in overwhelming volume, making it difficult to keep up with the newest information. Most previous research in automatic news organ...
Ao Feng, James Allan
IDA
2008
Springer
13 years 7 months ago
A comprehensive analysis of hyper-heuristics
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...
Ender Özcan, Burak Bilgin, Emin Erkan Korkmaz
3DIM
2005
IEEE
14 years 1 months ago
Fitting of 3D Circles and Ellipses Using a Parameter Decomposition Approach
Many optimization processes encounter a problem in efficiently reaching a global minimum or a near global minimum. Traditional methods such as Levenberg-Marquardt algorithm and t...
Xiaoyi Jiang, Da-Chuan Cheng
GECCO
2006
Springer
143views Optimization» more  GECCO 2006»
13 years 11 months ago
Hybrid search for cardinality constrained portfolio optimization
In this paper, we describe how a genetic algorithm approach added to a simulated annealing (SA) process offers a better alternative to find the mean variance frontier in the portf...
Miguel A. Gomez, Carmen X. Flores, Maria A. Osorio
HICSS
2005
IEEE
134views Biometrics» more  HICSS 2005»
14 years 1 months ago
A Non-Exact Approach and Experiment Studies on the Combinatorial Auction Problem
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu