914 search results - page 11 / 183 » Branch and Bound on the Network Model |
ICCV
2009
IEEE
15 years 11 days 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...
UAI
2004
13 years 8 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
ICCD
2006
IEEE
14 years 4 months ago
2006
IEEE
— Accurate estimation of worst-case crosstalk effects is critical for a realistic estimation of the worst-case behavior of deep sub-micron circuits. Crosstalk analysis models usu...
COCO
2005
Springer
14 years 28 days ago
2005
Springer
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
ICANN
2003
Springer
14 years 18 days ago
2003
Springer