16404 search results - page 910 / 3281 » A set coverage problem |
251
click to vote
LICS
1993
IEEE
15 years 11 months ago
1993
IEEE
We consider the veri cation of a particular class of in nite-state systems, namely systems consisting of nite-state processes that communicate via unbounded lossy FIFO channels. T...
163
Voted
FUN
2007
Springer
15 years 11 months ago
2007
Springer
A spreadsheet, especially MS Excel, is probably one of the most popular software applications for personal-computer users and gives us convenient and user-friendly tools for drawin...
225
Voted
FSTTCS
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We study the synthesis problem for external linear or branching specifications and distributed, synchronous architectures with arbitrary delays on processes. External mea...
183
Voted
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
216
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...