3495 search results - page 67 / 699 » On the random satisfiable process |
128
click to vote
SPAA
2009
ACM
15 years 7 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
101
Voted
AMAI
2004
Springer
15 years 6 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
119
Voted
KDD
2001
ACM
16 years 1 months ago
2001
ACM
Random projections have recently emerged as a powerful method for dimensionality reduction. Theoretical results indicate that the method preserves distances quite nicely; however,...
106
Voted
TIT
1998
15 years 10 days ago
1998
—A random number generator generates fair coin flips by processing deterministically an arbitrary source of nonideal randomness. An optimal random number generator generates asy...
CPC
2006
15 years 22 days ago
2006
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...