16404 search results - page 178 / 3281 » A set coverage problem |
127
Voted
TSMC
2010
14 years 10 months ago
2010
This paper is concerned with the set-membership filtering (SMF) problem for discrete-time nonlinear systems. We employ the Takagi
169
click to vote
CODCRY
2011
Springer
14 years 7 months ago
2011
Springer
Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2-regular-decoding problem is to find a nonzero codeword consisting of w length-B blocks, each of w...
113
Voted
ACNS
2009
Springer
15 years 7 months ago
2009
Springer
Computing Set Intersection privately and efficiently between two mutually mistrusting parties is an important basic procedure in the area of private data mining. Assuring robustnes...
126
Voted
FLAIRS
2000
15 years 4 months ago
2000
We first revisit a problem in the literature of genetic algorithms: arranging numbers into groups whose summed weights are as nearly equal as possible. We provide a new genetic al...
111
Voted
JSYML
2008
15 years 3 months ago
2008
Using a dictionary translating a variety of classical and modern covering properties into combinatorial properties of continuous images, we get a simple way to understand the inter...