Sciweavers

1816 search results - page 35 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
ECML
2007
Springer
15 years 6 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
ICTAI
2009
IEEE
14 years 9 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
15 years 6 months ago
Solving real-valued optimisation problems using cartesian genetic programming
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
James Alfred Walker, Julian Francis Miller
PERCOM
2006
ACM
15 years 11 months ago
Maximum Weighted Matching with Interference Constraints
In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization pro...
Gaurav Sharma, Ness B. Shroff, Ravi R. Mazumdar
GECCO
2003
Springer
15 years 5 months ago
Hierarchical BOA Solves Ising Spin Glasses and MAXSAT
Abstract. Theoretical and empirical evidence exists that the hierarchical Bayesian optimization algorithm (hBOA) can solve challenging hierarchical problems and anything easier. Th...
Martin Pelikan, David E. Goldberg