823 search results - page 4 / 165 » Stateful Subset Cover |
SIAMCO
2010
13 years 4 months ago
2010
In this paper, we extend fundamental notions of control theory to evolving compact subsets of the Euclidean space
CRYPTO
2001
Springer
14 years 2 months ago
2001
Springer
We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of...
SIROCCO
2010
13 years 11 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
14 years 3 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...
ESA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...