2244 search results - page 191 / 449 » A new heuristic approach for non-convex optimization problem... |
195
click to vote
NECO
2007
15 years 6 months ago
2007
In this paper, we propose two new support vector approaches for ordinal regression, which optimize multiple thresholds to define parallel discriminant hyperplanes for the ordinal...
380
click to vote
FUIN
2011
14 years 10 months ago
2011
In this article, a novel concept is introduced by using both unsupervised and supervised learning. For unsupervised learning, the problem of fuzzy clustering in microarray data as ...
201
click to vote
LION
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
212
click to vote
TPDS
2002
15 years 6 months ago
2002
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
180
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...