466 search results - page 7 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
PPDP
2001
Springer
15 years 1 months ago
2001
Springer
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...
STOC
2006
ACM
15 years 9 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
UAI
2008
14 years 11 months ago
2008
This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to ...
78
Voted
BIOCOMP
2009
14 years 10 months ago
2009
Long branch attraction is a problem that afflicts phylogenetic methods and a procedure to detect a data set suffering from this problem is the long branch extraction method[1]. Thi...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
embedded in a sliding-window scheme. Such exhaustive
search involves massive computation. Efficient Subwindow
Search (ESS) [11] avoids this by means of branch
and bound. However...