13734 search results - page 2452 / 2747 » Abstractions of data types |
169
click to vote
ISHPC
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
170
click to vote
SIGCOMM
1996
ACM
15 years 10 months ago
1996
ACM
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
151
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
Abstract. Most phylogenetics literature and construction methods based upon characters presume monomorphism (one state per character per species), yet polymorphism (multiple states...
160
click to vote
APL
1993
ACM
15 years 10 months ago
1993
ACM
Although multicomputers are becoming feasible for solving large problems, they are difficult to program: Extraction of parallelism from scalar languages is possible, but limited....
169
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
Abstract - We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology wh...