350 search results - page 45 / 70 » Lower and upper bounds on obtaining history independence |
102
click to vote
GLOBECOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— This paper introduces broadcasting relay nodes for orthogonal multiuser channels. The underlying idea is that a single relay node is shared by multiple source-destination pairs...
ICLP
1997
Springer
15 years 4 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
CSL
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
PODC
2004
ACM
15 years 5 months ago
2004
ACM
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
102
click to vote
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...