1362 search results - page 258 / 273 » Means, Correlations and Bounds |
107
click to vote
TARK
2007
Springer
15 years 3 months ago
2007
Springer
We contend that reasoning about knowledge is both natural and pragmatic for verification of electronic voting protocols. We present a model in which desirable properties of elect...
DSN
2005
IEEE
15 years 3 months ago
2005
IEEE
Fault-tolerant protocols, asynchronous and synchronous alike, make stationary fault assumptions: only a fraction f of the total n nodes may fail. Whilst a synchronous protocol is ...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— Packet buffers in router/switch interfaces constitute a central element of packet networks. The appropriate sizing of these buffers is an important and open research problem. M...
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
100
click to vote
COCO
2005
Springer
15 years 3 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...