4903 search results - page 8 / 981 » The Set Covering Machine |
AAIM
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we study the set cover games when the elements are selfish agents. In this case, each element has a privately known valuation of receiving the service from the sets,...
APPROX
2006
Springer
13 years 11 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...
ESORICS
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Interest in role-based access control has generated considerable research activity in recent years. A number of interesting problems related to the well known set cover p...
ADMA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
CIAC
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...