3495 search results - page 648 / 699 » On the random satisfiable process |
104
click to vote
CPM
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
FOCS
1992
IEEE
15 years 4 months ago
1992
IEEE
Wait-free implementations of shared objects tolerate the failure of processes, but not the failure of base objects from which they are implemented. We consider the problem of imple...
WADS
1993
Springer
15 years 3 months ago
1993
Springer
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
KDD
2010
ACM
15 years 3 months ago
2010
ACM
At Google, experimentation is practically a mantra; we evaluate almost every change that potentially affects what our users experience. Such changes include not only obvious user-...
119
click to vote
CF
2010
ACM
15 years 3 months ago
2010
ACM
The Message Passing Interface (MPI) is one of the most widely used programming models for parallel computing. However, the amount of memory available to an MPI process is limited ...