399 search results - page 18 / 80 » Parallel evolutionary algorithms can achieve super-linear pe... |
ICS
2011
Tsinghua U.
12 years 11 months ago
2011
Tsinghua U.
With the fast technical improvement, flash memory based Solid State Drives (SSDs) are becoming an important part of the computer storage hierarchy to significantly improve perfo...
PPOPP
2012
ACM
12 years 3 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
ANCS
2009
ACM
13 years 5 months ago
2009
ACM
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
Grid jobs often consist of a large number of tasks. If the performance of a statically scheduled grid job is unsatisfactory, one must decide which code of which task should be imp...