Sciweavers

15485 search results - page 47 / 3097
» Computing Optimal Subsets
Sort
View
EUROGP
2007
Springer
126views Optimization» more  EUROGP 2007»
13 years 11 months ago
Training Binary GP Classifiers Efficiently: A Pareto-coevolutionary Approach
The conversion and extension of the Incremental Pareto-Coevolution Archive algorithm (IPCA) into the domain of Genetic Programming classification is presented. In particular, the ...
Michal Lemczyk, Malcolm I. Heywood
JCO
2010
182views more  JCO 2010»
13 years 6 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu
JMLR
2012
11 years 10 months ago
Krylov Subspace Descent for Deep Learning
In this paper, we propose a second order optimization method to learn models where both the dimensionality of the parameter space and the number of training samples is high. In ou...
Oriol Vinyals, Daniel Povey
WIAMIS
2009
IEEE
14 years 2 months ago
Optimizing strategies for the exploration of social networks and associated data collections
Multimedia data collections immersed into social networks may be explored from the point of view of varying documents and users characteristics. In this paper, we develop a unifi...
Stéphane Marchand-Maillet, Eniko Szekely, E...
DEDS
2002
86views more  DEDS 2002»
13 years 7 months ago
On an Optimization Problem in Sensor Selection*
We address the following sensor selection problem. We assume that a dynamic system possesses a certain property, call it Property D, when a set G of sensors is used. There is a cos...
Rami Debouk, Stéphane Lafortune, Demostheni...