1569 search results - page 154 / 314 » Programming contest strategy |
114
click to vote
EUROPAR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Prefetching transfers a data item in advance from its storage location to its usage location so that communication is hidden and does not delay computation. We present a ...
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
105
Voted
IEEEPACT
2006
IEEE
15 years 6 months ago
2006
IEEE
On machines with high-performance processors, the memory system continues to be a performance bottleneck. Compilers insert prefetch operations and reorder data accesses to improve...
102
Voted
CSB
2003
IEEE
15 years 6 months ago
2003
IEEE
This paper describes a new strategy for designing degenerate primers for a given multiple alignment of amino acid sequences. Degenerate primers are useful for amplifying homologou...
144
Voted
HPDC
1996
IEEE
15 years 4 months ago
1996
IEEE
Load balancing involves assigning to each processor, work proportional to its performance, minimizing the execution time of the program. Althoughstatic load balancing can solve ma...