641 search results - page 24 / 129 » Branch and Bound Algorithm Selection by Performance Predicti... |
116
click to vote
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
JMLR
2006
14 years 9 months ago
2006
We present worst case bounds for the learning rate of a known prediction method that is based on hierarchical applications of binary context tree weighting (CTW) predictors. A heu...
104
click to vote
TREC
2004
14 years 11 months ago
2004
Our experiments in the Robust track this year focused on predicting query difficulty and using this prediction for improving information retrieval. We developed two prediction alg...
114
click to vote
ICOIN
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
MTA
2007
14 years 9 months ago
2007
In this paper, we proposed an improved “bottom-up” variable-size block matching method. Different from previous work, the proposed method does not need any threshold during th...