55 search results - page 1 / 11 » Hiding Satisfying Assignments: Two Are Better than One |
AAAI
2004
13 years 6 months ago
2004
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
GROUP
2009
ACM
13 years 11 months ago
2009
ACM
Scientiï¬c peer review, open source software development, wikis, and other domains use distributed review to improve quality of created content by providing feedback to the workâ...
ASIACRYPT
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Recently, Bellare and Palacio succeeded in defining the plaintext awareness, which is also called PA2, in the standard model. They propose three valiants of the standard ...
AI
2008
Springer
13 years 5 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
IJCAI
2001
13 years 6 months ago
2001
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...