Sciweavers

598 search results - page 9 / 120
» Note on parallel universes
Sort
View
66
Voted
PDP
1997
IEEE
15 years 1 months ago
Simulating the universe
Frazer R. Pearce, P. A. Thomas, R. M. Hutchings, H...
KR
1989
Springer
15 years 1 months ago
Impediments to Universal Preference-Based Default Theories
Research on nonmonotonic and default reasoning has identified several important criteria for preferring alternative default inferences. The theories of reasoning based on each of...
Jon Doyle, Michael P. Wellman
ACNS
2004
Springer
131views Cryptology» more  ACNS 2004»
15 years 1 months ago
Evaluating Security of Voting Schemes in the Universal Composability Framework
In the literature, voting protocols are considered secure if they satisfy requirements such as privacy, accuracy, robustness, etc. It can be time consuming to evaluate a voting pr...
Jens Groth
SPAA
2005
ACM
15 years 3 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
PDP
2009
IEEE
15 years 4 months ago
Two Formal Semantics of a Subset of the Paderborn University BSPlib
PUB (Paderborn University BSPLib) is a C library supporting the development of Bulk-Synchronous Parallel (BSP) algorithms. The BSP model allows an estimation of the execution time...
Frédéric Gava, Jean Fortin