564 search results - page 7 / 113 » Experimental Comparisons of Derivative Free Optimization Alg... |
EVOW
2007
Springer
14 years 1 months ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Genetic algorithms are a population-based Meta heuristics. They have been successfully applied to many optimization problems. However, premature convergence is an inherent charact...
IJCNN
2008
IEEE
14 years 1 months ago
2008
IEEE
— A novel sparse kernel density estimator is derived based on a regression approach, which selects a very small subset of significant kernels by means of the D-optimality experi...
ISNN
2005
Springer
14 years 1 months ago
2005
Springer
In least squares support vector (LS-SVM), the key challenge lies in the selection of free parameters such as kernel parameters and tradeoff parameter. However, when a large number ...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is ...