Results 211 to 220 of about 870,713 (237)
Some of the next articles are maybe not open access.
Covering Submonoids and Covering Codes
J. Autom. Lang. Comb., 1999This paper deals with the formalization of the intuitive notion of covering monoid and the investigation of the related algebraic properties. It is shown that covering monoids can be regarded as a generalization of the well known classical monoids and z-monoids. A new coding notion is introduced and a simple method to decide whether a finite set $X$ of
MADONIA, Maria Serafina +2 more
openaire +3 more sources
1995
Given two set systems, (V, F1) and (V, F2), the covering problem (resp. delta-covering problem) is to find F1 ∈ F1 and F2 ∈ F2 maximizing ‖F1 ∪ F2‖(resp. ‖F1ΔF2‖). The two problems are equivalent when F1 and F2 are the collections of bases of two matroids.
openaire +2 more sources
Given two set systems, (V, F1) and (V, F2), the covering problem (resp. delta-covering problem) is to find F1 ∈ F1 and F2 ∈ F2 maximizing ‖F1 ∪ F2‖(resp. ‖F1ΔF2‖). The two problems are equivalent when F1 and F2 are the collections of bases of two matroids.
openaire +2 more sources
Covering problems in facility location: A review
Computers and Industrial Engineering, 2012Mark Goh +2 more
exaly
Reduction and axiomization of covering generalized rough sets
Information Sciences, 2003William Zhu, Fei-Yue Wang
exaly
On some types of fuzzy covering-based rough sets
Fuzzy Sets and Systems, 2017Bin Yang, Bao Qing Hu
exaly
On Three Types of Covering-Based Rough Sets
IEEE Transactions on Knowledge and Data Engineering, 2007William Zhu, Fei-Yue Wang
exaly
Information structures in a covering information system
Information Sciences, 2020Gangqiang Zhang +2 more
exaly
A fuzzy covering-based rough set model and its generalization over fuzzy lattice
Information Sciences, 2016Bin Yang, Bao Qing Hu
exaly