16404 search results - page 264 / 3281 » A set coverage problem |
133
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
181
click to vote
DATAMINE
1999
15 years 4 months ago
1999
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
131
click to vote
EOR
2006
15 years 4 months ago
2006
We are concerned with a variation of the knapsack problem as well as of the knapsack sharing problem, where we are given a set of n items and a knapsack of a fixed capacity. As us...
122
click to vote
EVOW
2005
Springer
15 years 10 months ago
2005
Springer
We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Ker...
117
click to vote
IJCNN
2007
IEEE
15 years 10 months ago
2007
IEEE
—The Support Vector Machine is a widely employed machine learning model due to its repeatedly demonstrated superior generalization performance. The Sequential Minimal Optimizatio...