777 search results - page 147 / 156 » Learning dynamic algorithm portfolios |
KDD
2007
ACM
14 years 7 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
CCO
2001
Springer
13 years 12 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
JSAC
2007
13 years 7 months ago
2007
— One of the distinctive features in a wireless ad hoc network is lack of any central controller or single point of authority, in which each node/link then makes its own decision...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
The problem of tracking a varying number of non-rigid objects has two major difficulties. First, the observation models and target distributions can be highly non-linear and non-Ga...