16404 search results - page 92 / 3281 » A set coverage problem |
158
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
131
click to vote
PR
2008
15 years 3 months ago
2008
Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a ...
124
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
140
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...
JSYML
2008
15 years 3 months ago
2008
Some 40 years ago, Dana Scott proved that every countable Scott set is the standard system of a model of PA. Two decades later, Knight and