465 search results - page 77 / 93 » Optimization Over the Efficient Set of Multi-objective Conve... |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
GECCO
2007
Springer
14 years 19 days ago
2007
Springer
The Probabilistic Adaptive Mapping Developmental Genetic Programming (PAM DGP) algorithm that cooperatively coevolves a population of adaptive mappings and associated genotypes is...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
We consider support vector machines for binary classification. As opposed to most approaches we use the number of support vectors (the "L0 norm") as a regularizing term ...
JMLR
2010
13 years 3 months ago
2010
We present an extension of sparse PCA, or sparse dictionary learning, where the sparsity patterns of all dictionary elements are structured and constrained to belong to a prespeci...
Publication
In this paper we describe a new class of representations for realvalued parameters called Center of Mass Encoding (CoME). CoME is based on variable length strings, it is self-adap...