7049 search results - page 1155 / 1410 » Data Abstraction for CSP-OZ |
171
click to vote
SIGCOMM
1996
ACM
15 years 11 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...
159
Voted
STOC
1996
ACM
15 years 11 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...
165
click to vote
APL
1993
ACM
15 years 11 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....
170
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...
193
click to vote
ECAI
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. Many recent works point out that there are several possibilities of assigning a meaning to a concept definition containing some sort of recursion. In this paper, we argue...