Sciweavers

5326 search results - page 981 / 1066
» On what we can ensure
Sort
View
ICARIS
2003
Springer
15 years 11 months ago
Artificial Immune Systems and the Grand Challenge for Non-classical Computation
The UK Grand Challenges for Computing Research is an initiative to map out certain key areas that could be used to help drive research over the next 10–15 years. One of the ident...
Susan Stepney, John A. Clark, Colin G. Johnson, De...
SIGMETRICS
2000
ACM
101views Hardware» more  SIGMETRICS 2000»
15 years 10 months ago
On achievable service differentiation with token bucket marking for TCP
The Differentiated services (diffserv) architecture has been proposed as a scalable solution for providing service differentiation among flows without any per-flow buffer manage...
Sambit Sahu, Philippe Nain, Christophe Diot, Victo...
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 10 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
PODC
1989
ACM
15 years 10 months ago
Knowledge, Probability, and Adversaries
: What should it mean for an agent to know or believe an assertion is true with probability :99? Di erent papers FH88, FZ88, HMT88] give di erent answers, choosing to use quite di ...
Joseph Y. Halpern, Mark R. Tuttle
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
15 years 8 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III