Sciweavers

373 search results - page 26 / 75
» An ACO Algorithm for the Most Probable Explanation Problem
Sort
View
ADMA
2006
Springer
110views Data Mining» more  ADMA 2006»
13 years 11 months ago
Learning with Local Drift Detection
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Gladys Castillo
JMLR
2010
106views more  JMLR 2010»
13 years 2 months ago
Why Does Unsupervised Pre-training Help Deep Learning?
Much recent research has been devoted to learning algorithms for deep architectures such as Deep Belief Networks and stacks of auto-encoder variants, with impressive results obtai...
Dumitru Erhan, Yoshua Bengio, Aaron C. Courville, ...
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
14 years 2 months ago
Crossover operators for multiobjective k-subset selection
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
Thorsten Meinl, Michael R. Berthold
TC
2008
13 years 8 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
TEC
2008
100views more  TEC 2008»
13 years 8 months ago
Real-Valued Compact Genetic Algorithms for Embedded Microcontroller Optimization
Recent research on compact genetic algorithms (cGAs) has proposed a number of evolutionary search methods with reduced memory requirements. In cGAs, the evolution of populations is...
Ernesto Mininno, Francesco Cupertino, David Naso