1612 search results - page 163 / 323 » Analysing Randomized Distributed Algorithms |
159
click to vote
IMC
2010
ACM
15 years 2 months ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
280
click to vote
CP
2009
Springer
16 years 5 months ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
130
Voted
AAAI
2008
15 years 7 months ago
2008
We introduce novel algorithms for generating random solutions from a uniform distribution over the solutions of a boolean satisfiability problem. Our algorithms operate in two pha...
150
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
174
click to vote
NAS
2007
IEEE
15 years 11 months ago
2007
IEEE
In cluster-based storage systems, the metadata server cluster must be able to adaptively distribute responsibility for metadata to maintain high system performance and long-term l...