Sciweavers

5331 search results - page 106 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
EMO
2001
Springer
107views Optimization» more  EMO 2001»
15 years 2 months ago
Reducing Local Optima in Single-Objective Problems by Multi-objectivization
One common characterization of how simple hill-climbing optimization methods can fail is that they become trapped in local optima - a state where no small modi cation of the curren...
Joshua D. Knowles, Richard A. Watson, David Corne
ICANN
2009
Springer
15 years 2 months ago
A Two Stage Clustering Method Combining Self-Organizing Maps and Ant K-Means
This paper proposes a clustering method SOMAK, which is composed by Self-Organizing Maps (SOM) followed by the Ant K-means (AK) algorithm. The aim of this method is not to find an...
Jefferson R. Souza, Teresa Bernarda Ludermir, Lean...
ICDE
2007
IEEE
98views Database» more  ICDE 2007»
15 years 4 months ago
Towards Adaptive Costing of Database Access Methods
Most database query optimizers use cost models to identify good query execution plans. Inaccuracies in the cost models can cause query optimizers to select poor plans. In this pap...
Ye Qin, Kenneth Salem, Anil K. Goel
PR
2002
104views more  PR 2002»
14 years 9 months ago
A geometric approach for the analysis and computation of the intrinsic camera parameters
The authors of this paper adopted the projected characteristics of the absolute conic in terms of the Pascal's theorem to propose an entirely new camera calibration method ba...
Eduardo Bayro-Corrochano, Bodo Rosenhahn
CORR
2006
Springer
68views Education» more  CORR 2006»
14 years 10 months ago
A rigorous proof of the cavity method for counting matchings
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...
Mohsen Bayati, Chandra Nair