Sciweavers

1209 search results - page 237 / 242
» Universal Algebra and Computer Science
Sort
View
CRYPTO
1987
Springer
87views Cryptology» more  CRYPTO 1987»
14 years 2 days ago
How to Make Replicated Data Secure
Many distributed systems manage some form of long-lived data, such as files or data bases. The performance and fault-tolerance of such systems may be enhanced if the repositories ...
Maurice Herlihy, J. D. Tygar
AAAI
2008
13 years 11 months ago
Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using
ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...
Andrew Gilpin, Tuomas Sandholm
COLT
2008
Springer
13 years 10 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
DALT
2008
Springer
13 years 10 months ago
Abstracting and Verifying Strategy-Proofness for Auction Mechanisms
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
Emmanuel M. Tadjouddine, Frank Guerin, Wamberto We...
LWA
2008
13 years 10 months ago
Towards the Adaptation of Scientific Course Material powered by Communities of Practice
Several applications support the adaptation of course material. Even though most of these systems allow to specify interaction preferences or even employ user modeling techniques,...
Christine Müller