466 search results - page 18 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
CPAIOR
2006
Springer
15 years 1 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...
114
click to vote
ALENEX
2001
14 years 11 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
DMIN
2007
14 years 11 months ago
2007
— The application of feature selection techniques greatly reduces the computational cost of classifying highdimensional data. Feature selection algorithms of varying performance ...
82
Voted
ICTAI
2003
IEEE
15 years 2 months ago
2003
IEEE
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
EOR
2008
14 years 9 months ago
2008
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...