1277 search results - page 112 / 256 » Terminating Decision Algorithms Optimally |
145
Voted
PAMI
2011
14 years 10 months ago
2011
—A novel framework is proposed for the design of cost-sensitive boosting algorithms. The framework is based on the identification of two necessary conditions for optimal cost-sen...
123
Voted
CVPR
2003
IEEE
16 years 5 months ago
2003
IEEE
We introduce a new classification algorithm based on the concept of Symmetric Maximized Minimal distance in Subspace (SMMS). Given the training data of authentic samples and impos...
144
Voted
COCOA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
135
Voted
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
Most surrogate approaches to multi-objective optimization build a surrogate model for each objective. These surrogates can be used inside a classical Evolutionary Multiobjective O...
163
click to vote
CSCLP
2008
Springer
15 years 5 months ago
2008
Springer
We consider constraint optimization problems where costs (or preferences) are all given, but some are tagged as possibly unstable, and provided with a range of alternative values. ...