80 search results - page 4 / 16 » Optimizing Sort in Hadoop Using Replacement Selection |
106
click to vote
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
This poster paper summarizes our research on fault tolerance arising as a by-product of the evolutionary computation process. Past research has shown evidence of robustness emergin...
125
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Standard tournament selection samples individuals with replacement. The sampling-with-replacement strategy has its advantages but also has issues. One of the commonly recognised i...
139
click to vote
EMSOFT
2010
Springer
15 years 1 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
129
click to vote
SIGECOM
2009
ACM
15 years 9 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
118
click to vote
PR
2010
15 years 1 months ago
2010
The performance of m-out-of-n bagging with and without replacement in terms of the sampling ratio (m/n) is analyzed. Standard bagging uses resampling with replacement to generate ...