Sciweavers

223 search results - page 29 / 45
» Proving Termination by Bounded Increase
Sort
View
CN
2004
130views more  CN 2004»
14 years 9 months ago
The effect of bandwidth and buffer pricing on resource allocation and QoS
Congestion-based pricing of network resources is a common approach in evolving network architectures that support Quality of Service (QoS). Resource usage and QoS will thus fluctu...
Nan Jin, Scott Jordan
RSA
2006
68views more  RSA 2006»
14 years 9 months ago
The probabilistic analysis of a greedy satisfiability algorithm
: On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of cl...
Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios...
111
Voted
ACL2
2006
ACM
15 years 3 months ago
A verifying core for a cryptographic language compiler
A verifying compiler is one that emits both object code and a proof of correspondence between object and source code.1 We report the use of ACL2 in building a verifying compiler f...
Lee Pike, Mark Shields, John Matthews
74
Voted
ASIACRYPT
2004
Springer
15 years 2 months ago
Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...
Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk
CORR
2006
Springer
120views Education» more  CORR 2006»
14 years 9 months ago
On the Role of Shared Entanglement
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
Dmitry Gavinsky