78 search results - page 9 / 16 » A comparison of empirical and model-driven optimization |
ACML
2009
Springer
15 years 1 months ago
2009
Springer
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
69
Voted
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
AIPS
2009
14 years 10 months ago
2009
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
CORR
2000
Springer
14 years 9 months ago
2000
Springer
In real-world environments it usually is difficult to specify target operating conditions precisely, for example, target misclassification costs. This uncertainty makes building ro...