16404 search results - page 174 / 3281 » A set coverage problem |
107
Voted
EOR
2006
15 years 3 months ago
2006
This paper describes a framework for analysing matches in multiple data sets. The framework described is quite general and can be applied to a variety of problems where matches ar...
137
Voted
ISCI
2008
15 years 3 months ago
2008
In order to discover interesting patterns and dependencies in data, an approach based on rough set theory can be used. In particular, Dominance-based Rough Set Approach (DRSA) has...
JSYML
2002
15 years 3 months ago
2002
Abstract. We prove some results related to the problem of blowing up the power set of the least measurable cardinal. Our forcing results improve those of [1] by using the optimal h...
115
Voted
MP
2010
15 years 1 months ago
2010
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
122
Voted
SOCO
2008
Springer
15 years 3 months ago
2008
Springer
Attribute reduction of an information system is a key problem in rough set theory and its applications. Using computational intelligence (CI) tools to solve such problems has rece...