20197 search results - page 678 / 4040 » Comparing Computational Power |
176
click to vote
COCOA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
159
Voted
EUROPAR
1995
Springer
15 years 11 months ago
1995
Springer
The growing disparity between processor and memory speeds has caused memory bandwidth to become the performance bottleneck for many applications. In particular, this performance ga...
193
Voted
WSC
1997
15 years 8 months ago
1997
This paper deals with ranking and selection problem via simulation. We present an optimal computing budget allocation technique which can select the best of k simulated designs. T...
164
Voted
AMC
2007
15 years 7 months ago
2007
: For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were p...
187
Voted
TSMC
2008
15 years 7 months ago
2008
: Automatic identification of genes has been an actively researched area of Bioinformatics. Compared to earlier attempts for finding genes, the recent techniques are significantly ...