1401 search results - page 81 / 281 » Randomness in Interactive Proofs |
PATAT
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Within the field of software agents, there has been increasing interest in automating the process of calendar scheduling in recent years. Calendar (or meeting) schedulin...
STACS
2012
Springer
13 years 5 months ago
2012
Springer
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
JCT
2000
14 years 9 months ago
2000
A partial order on Z obtained by taking the transitive closure of a random relation {i < j and there is an edge ij} is studied. Randomness stems from postulating that an edge ij...
ATVA
2008
Springer
14 years 11 months ago
2008
Springer
We present a compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interaction without data transf...
CSCWD
2009
Springer
15 years 4 months ago
2009
Springer
Constrained random simulation methodology still plays an important role in hardware verification due to the limited scalability of formal verification, especially for the large an...