1456 search results - page 11 / 292 » Improved Randomized Results for That Interval Selection Prob... |
SARA
2009
Springer
15 years 4 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
ESA
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
FOCS
2006
IEEE
15 years 4 months ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
This paper studies the ensemble selection problem for unsupervised learning. Given a large library of different clustering solutions, our goal is to select a subset of solutions t...
IPPS
1996
IEEE
15 years 2 months ago
1996
IEEE
In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for paralle...