4131 search results - page 185 / 827 » The Generalized Max-Controlled Set Problem |
110
click to vote
ICANN
2001
Springer
15 years 8 months ago
2001
Springer
Sparse kernel regressors have become popular by applying the support vector method to regression problems. Although this approach has been shown to exhibit excellent generalization...
136
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
128
Voted
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...
101
Voted
IPCO
2004
15 years 5 months ago
2004
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its o...
120
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and ...