4451 search results - page 138 / 891 » On Random Ordering Constraints |
172
click to vote
CAV
2000
Springer
15 years 9 months ago
2000
Springer
Address: Abstraction, Composition, Symmetry, and a Little Deduction: The Remedies to State Explosion . . . . . . . . . . . . . . . . . . . . . . . . . . 1 A. Pnueli Invited Address...
139
click to vote
ASPDAC
2009
ACM
15 years 11 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
172
click to vote
AICT
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper presents the simplified method of random test suite based on the frequency (block) test. The test is used to check the first property of random numbers which is to have ...
123
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
132
Voted
MST
2000
15 years 4 months ago
2000
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...