641 search results - page 14 / 129 » Branch and Bound Algorithm Selection by Performance Predicti... |
140
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
120
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...
121
click to vote
AUSAI
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. The algorithm selection problem aims to select the best algorithm for an input problem instance according to some characteristics of the instance. This paper presents a l...
ICCS
2001
Springer
15 years 6 months ago
2001
Springer
: Performance modeling for scientific production codes is of interest both for program tuning and for the selection of new machines. An empirical method is used for developing a m...
109
click to vote
SAT
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...