2917 search results - page 271 / 584 » Satisfying Interaction Constraints |
159
click to vote
AAAI
1997
15 years 8 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
157
click to vote
AAAI
1990
15 years 7 months ago
1990
Recently-developed techniques have improved the performance of production systems several times over. However, these techniques are not yet adequate for continuous problem solving...
176
click to vote
EUROPAR
2010
Springer
15 years 7 months ago
2010
Springer
This paper introduces a set object, namely a shared object that allows processes to add and remove values as well as take a snapshot of its content. A new consistency condition su...
175
click to vote
WWW
2010
ACM
15 years 6 months ago
2010
ACM
We study the problem of anonymizing user profiles so that user privacy is sufficiently protected while the anonymized profiles are still effective in enabling personalized web sea...
163
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We present the first polynomial-time approximation algorithms for single-minded envy-free profit-maximization problems [13] with limited supply. Our algorithms return a pricing sc...