641 search results - page 19 / 129 » Branch and Bound Algorithm Selection by Performance Predicti... |
70
Voted
ICONIP
2007
14 years 11 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
CPAIOR
2004
Springer
15 years 3 months ago
2004
Springer
This paper addresses the question of selecting an algorithm from a predefined set that will have the best performance on a scheduling problem instance. Our goal is to reduce the e...
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
It is a challenging task to accurately model the performance of a face recognition system, and to predict its individual recognition results under various environments. This paper...
105
click to vote
PPSN
2010
Springer
14 years 7 months ago
2010
Springer
The target of machine learning is a predictive model that performs well on unseen data. Often, such a model has multiple intended uses, related to different points in the tradeoff ...
CGO
2007
IEEE
15 years 1 months ago
2007
IEEE
Dynamic predication has been proposed to reduce the branch misprediction penalty due to hard-to-predict branch instructions. A recently proposed dynamic predication architecture, ...