Sciweavers

1186 search results - page 147 / 238
» Improving Random Walk Performance
Sort
View
CP
2005
Springer
14 years 4 months ago
Dynamic Ordering for Asynchronous Backtracking on DisCSPs
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
Roie Zivan, Amnon Meisels
GCC
2005
Springer
14 years 4 months ago
Exploiting the Heterogeneity in Structured Peer-to-Peer Systems
The structured peer-to-peer system, which is based on the distributed hash table, offers an administration-free and fault-tolerant application-level overlay network. However, a ra...
Tongqing Qiu, Guihai Chen
HOTOS
2003
IEEE
14 years 4 months ago
Secure Data Replication over Untrusted Hosts
Data replication is a widely used technique for achieving fault tolerance and improved performance. With the advent of content delivery networks, it is becoming more and more freq...
Bogdan C. Popescu, Bruno Crispo, Andrew S. Tanenba...
CHES
2003
Springer
88views Cryptology» more  CHES 2003»
14 years 4 months ago
A New Algorithm for Switching from Arithmetic to Boolean Masking
To protect a cryptographic algorithm against Differential Power Analysis, a general method consists in masking all intermediate data with a random value. When a cryptographic algo...
Jean-Sébastien Coron, Alexei Tchulkine
COLT
2001
Springer
14 years 3 months ago
On Learning Monotone DNF under Product Distributions
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...
Rocco A. Servedio