417 search results - page 57 / 84 » Running Time Predictions for Factoring Algorithms |
75
Voted
CGO
2009
IEEE
15 years 4 months ago
2009
IEEE
—Fast track is a software speculation system that enables unsafe optimization of sequential code. It speculatively runs optimized code to improve performance and then checks the ...
RECOMB
2006
Springer
15 years 10 months ago
2006
Springer
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
PPOPP
1999
ACM
15 years 2 months ago
1999
ACM
Writing parallel applications for computational grids is a challenging task. To achieve good performance, algorithms designed for local area networks must be adapted to the differ...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
CGO
2004
IEEE
15 years 1 months ago
2004
IEEE
Empirical search is a strategy used during the installation of library generators such as ATLAS, FFTW, and SPIRAL to identify the algorithm or the version of an algorithm that del...