Sciweavers

653 search results - page 6 / 131
» Using common random numbers for indifference-zone selection
Sort
View
IJCNN
2007
IEEE
14 years 1 months ago
Random Feature Subset Selection for Analysis of Data with Missing Features
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
Joseph DePasquale, Robi Polikar
FPGA
2008
ACM
146views FPGA» more  FPGA 2008»
13 years 9 months ago
FPGA-optimised high-quality uniform random number generators
This paper introduces a method of constructing random number generators from four of the basic primitives provided by FPGAs: Flip-Flips, Lookup-Tables, Shift Registers, and RAMs. ...
David B. Thomas, Wayne Luk
ICDM
2002
IEEE
133views Data Mining» more  ICDM 2002»
14 years 15 days ago
Estimating the number of segments in time series data using permutation tests
Segmentation is a popular technique for discovering structure in time series data. We address the largely open problem of estimating the number of segments that can be reliably di...
Kari Vasko, Hannu Toivonen
IEEEPACT
2007
IEEE
14 years 1 months ago
L1 Cache Filtering Through Random Selection of Memory References
Distinguishing transient blocks from frequently used blocks enables servicing references to transient blocks from a small fully-associative auxiliary cache structure. By inserting...
Yoav Etsion, Dror G. Feitelson
FOGA
1990
13 years 8 months ago
A Comparative Analysis of Selection Schemes Used in Genetic Algorithms
This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, a...
David E. Goldberg, Kalyanmoy Deb