466 search results - page 29 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
131
click to vote
DISOPT
2011
14 years 6 months ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
101
click to vote
ICML
2005
IEEE
16 years 18 days ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
105
click to vote
WAIM
2007
Springer
15 years 5 months ago
2007
Springer
To solve the overlapping search of multidimensional spatial database containing large quantity of objects with dynamic spatial extent, this paper proposes an index structure named ...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
In this paper, we study the Nair-El Gamal outer bound and Marton's inner bound for general two-receiver broadcast channels. We show that the Nair-El Gamal outer bound can be m...
111
click to vote
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...