399 search results - page 30 / 80 » Parallel evolutionary algorithms can achieve super-linear pe... |
ASPLOS
1992
ACM
13 years 11 months ago
1992
ACM
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
EUROPAR
2001
Springer
14 years 3 days ago
2001
Springer
High-accuracy PDE solvers use multi-dimensional fast Fourier transforms. The FFTs exhibits a static and structured memory access pattern which results in a large amount of communic...
DAC
2007
ACM
14 years 8 months ago
2007
ACM
Pattern matching is essential to a wide range of applications such as network intrusion detection, virus scanning, etc. Pattern matching algorithms normally rely on state machines...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
The Coarse-Grained Monte Carlo (CGMC) method is a multi-scale stochastic mathematical and simulation framework for spatially distributed systems. CGMC simulations are important too...
ASAP
2008
IEEE
14 years 2 months ago
2008
IEEE
We address the problem of data parallel processing for computational quantum chemistry (CQC). CQC is a computationally demanding tool to study the electronic structure of molecule...