Sciweavers

547 search results - page 24 / 110
» A hybrid approach to parameter tuning in genetic algorithms
Sort
View
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
EVOW
2007
Springer
14 years 1 months ago
Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems
Abstract. Addressing dynamic optimization problems has been a challenging task for the genetic algorithm community. Over the years, several approaches have been developed into gene...
Shengxiang Yang
NIPS
2008
13 years 9 months ago
Automatic online tuning for fast Gaussian summation
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
Vlad I. Morariu, Balaji Vasan Srinivasan, Vikas C....
ESA
2004
Springer
103views Algorithms» more  ESA 2004»
14 years 28 days ago
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
Michael R. Fellows, Christian Knauer, Naomi Nishim...
ESWA
2007
176views more  ESWA 2007»
13 years 7 months ago
Credit scoring with a data mining approach based on support vector machines
The credit card industry has been growing rapidly recently, and thus huge numbers of consumers’ credit data are collected by the credit department of the bank. The credit scorin...
Cheng-Lung Huang, Mu-Chen Chen, Chieh-Jen Wang