12 search results - page 1 / 3 » E-matching for Fun and Profit |
PODC
2011
ACM
12 years 8 months ago
2011
ACM
: Analyzing Consistency Properties for Fun and Profit Wojciech Golab, Xiaozhou Li, Mehul A. Shah HP Laboratories HPL-2011-6 data consistency, algorightms, key-value stores Moti...
WWW
2004
ACM
14 years 6 months ago
2004
ACM
Recommender systems have emerged in the past several years as an effective way to help people cope with the problem of information overload. One application in which they have bec...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
USS
2004
13 years 6 months ago
2004
It is well known that it is insecure to use the access(2) system call in a setuid program to test for the ability of the program's executor to access a file before opening sa...
ENTCS
2008
13 years 5 months ago
2008
Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quant...