Sciweavers

397 search results - page 45 / 80
» An empirical study of optimizations in YOGI
Sort
View
GECCO
2010
Springer
162views Optimization» more  GECCO 2010»
14 years 16 days ago
Heuristics for sampling repetitions in noisy landscapes with fitness caching
For many large-scale combinatorial search/optimization problems, meta-heuristic algorithms face noisy objective functions, coupled with computationally expensive evaluation times....
Forrest Stonedahl, Susa H. Stonedahl
EC
2008
175views ECommerce» more  EC 2008»
13 years 7 months ago
Multiobjective Immune Algorithm with Nondominated Neighbor-Based Selection
Nondominated Neighbor Immune Algorithm (NNIA) is proposed for multiobjective optimization by using a novel nondominated neighbor-based selection technique, an immune inspired oper...
Maoguo Gong, Licheng Jiao, Haifeng Du, Liefeng Bo
JMLR
2006
145views more  JMLR 2006»
13 years 7 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
IJCNN
2006
IEEE
14 years 1 months ago
Semi-Supervised Model Selection Based on Cross-Validation
We propose a new semi-supervised model selection method that is derived by applying the structural risk minimization principle to a recent semi-supervised generalization error bou...
Matti Kaariainen
COR
2006
122views more  COR 2006»
13 years 7 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...