Sciweavers

2244 search results - page 26 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
ECML
2007
Springer
15 years 3 months ago
Fast Optimization Methods for L1 Regularization: A Comparative Study and Two New Approaches
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
Mark Schmidt, Glenn Fung, Rómer Rosales
NCI
2004
125views Neural Networks» more  NCI 2004»
14 years 11 months ago
A new approach to blind source separation with global optimal property
This paper presents a new independency metric for blind source separation (BSS) problem. It is mathematically proved that the metric value of any linear combination of source sign...
Yiu-ming Cheung, Hailin Liu
80
Voted
ICANNGA
2009
Springer
163views Algorithms» more  ICANNGA 2009»
15 years 1 months ago
Elitistic Evolution: An Efficient Heuristic for Global Optimization
A new evolutionary algorithm, Elitistic Evolution (termed EEv), is proposed in this paper. EEv is an evolutionary method for numerical optimization with adaptive behavior. EEv uses...
Francisco Viveros Jiménez, Efrén Mez...
GECCO
2009
Springer
139views Optimization» more  GECCO 2009»
15 years 2 months ago
Meta-heuristics for reconstructing cross cut shredded text documents
In this work, we present two new approaches based on variable neighborhood search (VNS) and ant colony optimization (ACO) for the reconstruction of cross cut shredded text documen...
Matthias Prandtstetter, Günther R. Raidl
TEC
2002
152views more  TEC 2002»
14 years 9 months ago
Ant colony optimization for resource-constrained project scheduling
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
Daniel Merkle, Martin Middendorf, Hartmut Schmeck