5316 search results - page 105 / 1064 » Which Search Problems Are Random |
137
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
105
click to vote
CISIS
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper proposes a fast AND/OR tree search algorithm using a multiple-paths concurrent search method. Conventional heuristic AND/OR tree search algorithms expand nodes in only ...
124
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
128
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
117
Voted
ASIACRYPT
2009
Springer
15 years 10 months ago
2009
Springer
Adaptive oblivious transfer (adaptive OT) schemes have wide applications such as oblivious database searches, secure multiparty computation and etc. It is a two-party protocol whic...