1182 search results - page 62 / 237 » Iterative Methods in Combinatorial Optimization |
106
click to vote
GECCO
2010
Springer
15 years 3 months ago
2010
Springer
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
124
click to vote
WSC
2004
15 years 3 months ago
2004
This paper develops a variant of Simulated Annealing (SA) algorithm for solving discrete stochastic optimization problems where the objective function is stochastic and can be eva...
ICDM
2008
IEEE
15 years 8 months ago
2008
IEEE
Zero-norm, defined as the number of non-zero elements in a vector, is an ideal quantity for feature selection. However, minimization of zero-norm is generally regarded as a combi...
IJCNN
2006
IEEE
15 years 8 months ago
2006
IEEE
— A key step in many statistical learning methods used in machine learning involves solving a convex optimization problem containing one or more hyper-parameters that must be sel...
162
click to vote
AAAI
2011
14 years 1 months ago
2011
In this paper, we propose a novel method to select the most informative subset of features, which has little redundancy and very strong discriminating power. Our proposed approach...