5138 search results - page 437 / 1028 » Randomized Algorithms for 3-SAT |
188
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
174
click to vote
EUROPAR
2009
Springer
16 years 1 months ago
2009
Springer
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
177
click to vote
SSDBM
2007
IEEE
16 years 1 months ago
2007
IEEE
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
179
click to vote
ISAAC
2005
Springer
16 years 10 days ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
170
click to vote
TACAS
2005
Springer
16 years 9 days ago
2005
Springer
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...