Sciweavers

2182 search results - page 254 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
GECCO
2005
Springer
147views Optimization» more  GECCO 2005»
15 years 8 months ago
Unbiased tournament selection
Tournament selection is a popular form of selection which is commonly used with genetic algorithms, genetic programming and evolutionary programming. However, tournament selection...
Artem Sokolov, Darrell Whitley
INFORMS
2006
87views more  INFORMS 2006»
15 years 2 months ago
Early Estimates of the Size of Branch-and-Bound Trees
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
Gérard Cornuéjols, Miroslav Karamano...
MCS
2009
Springer
15 years 9 months ago
Selective Ensemble under Regularization Framework
An ensemble is generated by training multiple component learners for a same task and then combining them for predictions. It is known that when lots of trained learners are availab...
Nan Li, Zhi-Hua Zhou
161
Voted
JMLR
2012
13 years 4 months ago
Detecting Network Cliques with Radon Basis Pursuit
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
Xiaoye Jiang, Yuan Yao, Han Liu, Leonidas J. Guiba...
138
Voted
ALT
2003
Springer
15 years 11 months ago
Kernel Trick Embedded Gaussian Mixture Model
In this paper, we present a kernel trick embedded Gaussian Mixture Model (GMM), called kernel GMM. The basic idea is to embed kernel trick into EM algorithm and deduce a parameter ...
Jingdong Wang, Jianguo Lee, Changshui Zhang