538 search results - page 3 / 108 » An Approach of Implementing General Learning Companions for ... |
ALT
2004
Springer
14 years 1 months ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
ECML
2003
Springer
13 years 9 months ago
2003
Springer
In traditional multi-instance (MI) learning, a single positive instance in a bag produces a positive class label. Hence, the learner knows how the bag’s class label depends on th...
ISCAS
2003
IEEE
13 years 9 months ago
2003
IEEE
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
ICML
2009
IEEE
14 years 5 months ago
2009
IEEE
Many machine learning algorithms can be formulated as a generalized eigenvalue problem. One major limitation of such formulation is that the generalized eigenvalue problem is comp...