Sciweavers

2609 search results - page 65 / 522
» Optimizing for parallelism and data locality
Sort
View
101
Voted
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 3 months ago
Multi-niche crowding in the development of parallel genetic simulated annealing
In this paper, a new hybrid of genetic algorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from ...
Zhi-Gang Wang, Mustafizur Rahman 0002, Yoke-San Wo...
127
Voted
HPCA
2011
IEEE
14 years 2 months ago
Essential roles of exploiting internal parallelism of flash memory based solid state drives in high-speed data processing
Flash memory based solid state drives (SSDs) have shown a great potential to change storage infrastructure fundamentally through their high performance and low power. Most recent ...
Feng Chen, Rubao Lee, Xiaodong Zhang
92
Voted
AMC
2004
115views more  AMC 2004»
14 years 10 months ago
Performance comparison of memetic algorithms
Local search techniques have been applied in optimization methods. The effect of local search to the memetic algorithms can make multimodal and non-linear problems easier to solve...
Jason G. Digalakis, Konstantinos G. Margaritis
90
Voted
AAAI
2006
14 years 11 months ago
An Efficient Algorithm for Local Distance Metric Learning
Learning application-specific distance metrics from labeled data is critical for both statistical classification and information retrieval. Most of the earlier work in this area h...
Liu Yang, Rong Jin, Rahul Sukthankar, Yi Liu
84
Voted
PLDI
2010
ACM
15 years 3 months ago
Supporting speculative parallelization in the presence of dynamic data structures
The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative s...
Chen Tian, Min Feng, Rajiv Gupta