994 search results - page 54 / 199 » Custom Computing Machines for the Set Covering Problem |
100
click to vote
CORR
2008
Springer
15 years 25 days ago
2008
Springer
In this paper, we propose a method for support vector machine classification using indefinite kernels. Instead of directly minimizing or stabilizing a nonconvex loss function, our...
125
click to vote
FSTTCS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
118
click to vote
CSCLP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
135
Voted
4OR
2008
14 years 11 months ago
2008
The two-dimensional level strip packing problem (2LSPP) consists in packing rectangular items of given size into a strip of given width divided into levels. Items packed into the ...
95
Voted
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...