3055 search results - page 352 / 611 » Randomized Search Trees |
121
click to vote
PR
2006
15 years 3 months ago
2006
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offere...
126
click to vote
SIAMCOMP
2002
15 years 3 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
136
click to vote
IJCAI
2003
15 years 5 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
168
click to vote
ILP
2004
Springer
15 years 9 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
140
click to vote
AAAI
2008
15 years 6 months ago
2008
Previous studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be...