5263 search results - page 735 / 1053 » Open Constraint Optimization |
191
click to vote
CPAIOR
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
173
click to vote
SDM
2010
SIAM
15 years 8 months ago
2010
SIAM
The high computational cost of nonlinear support vector machines has limited their usability for large-scale problems. We propose two novel stochastic algorithms to tackle this pr...
205
click to vote
NETWORKING
2008
15 years 8 months ago
2008
There have been research initiatives in centralized control recently, which advocate that the control of an autonomous system (AS) should be performed in a centralized fashion. In ...
162
click to vote
NIPS
2007
15 years 8 months ago
2007
Maximum variance unfolding (MVU) is an effective heuristic for dimensionality reduction. It produces a low-dimensional representation of the data by maximizing the variance of the...
195
click to vote
NIPS
2007
15 years 8 months ago
2007
Semi-supervised inductive learning concerns how to learn a decision rule from a data set containing both labeled and unlabeled data. Several boosting algorithms have been extended...