Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
In this paper, the notion termed a "nonstationary fuzzy set" is introduced, and the concept of a perturbation function that is used for generating nonstationary fuzzy set...
Jonathan M. Garibaldi, Marcin Jaroszewski, Salang ...
In this paper we consider the relative expressive power of two very common operators applicable to sets and multisets: the with and the union operators. For such operators we prove...
We show that any expression of the relational division operator in the relational algebra with union, difference, projection, selection, constant-tagging, and joins, must produce ...
An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called union-free if there are no three distinct sets in th...