2254 search results - page 7 / 451 » Computing the minimal covering set |
DIS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper, first we introduce minimal and closed monotone DNF formulas as extensions of maximal and closed itemsets. Next, by incorporating the algorithm dnf cover d...
APPROX
2006
Springer
15 years 3 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
116
click to vote
SIROCCO
2010
15 years 1 months ago
2010
Given a collection C of weighted subsets of a ground set E, the set cover problem is to find a minimum weight subset of C which covers all elements of E. We study a strategic game ...
ESA
2005
Springer
15 years 5 months ago
2005
Springer
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
120
click to vote
ISCI
2011
14 years 6 months ago
2011
We present a general rule induction algorithm based on sequential covering, suitable for variable consistency rough set approaches. This algorithm, called VC-DomLEM, can be used f...