Sciweavers

3422 search results - page 33 / 685
» Random Subset Optimization
Sort
View
ICPP
1993
IEEE
15 years 6 months ago
Activity Counter: New Optimization for the Dynamic Scheduling of SIMD Control Flow
SIMD or vector computers and collection-oriented languages, like C , are designed to perform the same computation on each data item or on just a subset of the data. Subsets of pro...
Ronan Keryell, Nicolas Paris
CSDA
2010
133views more  CSDA 2010»
14 years 11 months ago
Optimized fixed-size kernel models for large data sets
A modified active subset selection method based on quadratic R
Kris De Brabanter, Jos De Brabanter, Johan A. K. S...
GECCO
2007
Springer
157views Optimization» more  GECCO 2007»
15 years 8 months ago
Earthquake classifying neural networks trained with random dynamic neighborhood PSOs
Arvind S. Mohais, Rosemarie Mohais, Christopher Wa...
GECCO
2007
Springer
169views Optimization» more  GECCO 2007»
15 years 8 months ago
Hybrid evolutionary algorithms on minimum vertex cover for random graphs
Martin Pelikan, Rajiv Kalapala, Alexander K. Hartm...
AAAI
2008
15 years 4 months ago
Trace Ratio Criterion for Feature Selection
Fisher score and Laplacian score are two popular feature selection algorithms, both of which belong to the general graph-based feature selection framework. In this framework, a fe...
Feiping Nie, Shiming Xiang, Yangqing Jia, Changshu...