1041 search results - page 24 / 209 » Randomizing Reductions of Search Problems |
114
click to vote
AMAI
2004
Springer
15 years 7 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
137
click to vote
CORR
2012
Springer
13 years 10 months ago
2012
Springer
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
137
click to vote
TOPNOC
2010
14 years 9 months ago
2010
Abstract. State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search...
112
click to vote
CRYPTO
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
146
click to vote
CPAIOR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...