10304 search results - page 1664 / 2061 » Computer science with the sciences: an emphasis in computati... |
191
click to vote
SIGECOM
2003
ACM
16 years 2 days ago
2003
ACM
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
192
click to vote
BIRTHDAY
2003
Springer
16 years 2 days ago
2003
Springer
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
202
click to vote
ERSHOV
2003
Springer
16 years 1 days ago
2003
Springer
By obfuscation we mean any efficient semantic-preserving transformation of computer programs aimed at bringing a program into such a form, which impedes the understanding of its al...
170
click to vote
ICALP
2003
Springer
16 years 1 days ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
211
click to vote
ICALP
2003
Springer
16 years 1 days ago
2003
Springer
Many protocols are designed to operate correctly even in the case where the underlying communication medium is faulty. To capture the behaviour of such protocols, lossy channel sy...