8125 search results - page 297 / 1625 » Parallelism and evolutionary algorithms |
159
click to vote
PDPTA
2000
15 years 5 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
116
click to vote
SAC
2004
ACM
15 years 10 months ago
2004
ACM
In this work we propose a parallel algorithm for the efficient extraction of binding-site consensus from genomic sequences. This algorithm, based on an existing approach, extracts...
155
click to vote
TCS
2008
15 years 4 months ago
2008
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
111
click to vote
JPDC
2006
15 years 4 months ago
2006
This paper focuses on solving large size combinatorial optimization problems using a Grid-enabled framework called ParadisEO
113
click to vote
ISPA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. A loop with irregular assignment computations contains loopcarried output data dependences that can only be detected at run-time. In this paper, a load-balanced method ba...