2496 search results - page 147 / 500 » On covering by translates of a set |
168
click to vote
ARSCOM
2000
15 years 6 months ago
2000
The minimum number of incomplete blocks required to cover, exactly times, all t-element subsets from a set V of cardinality v (v > t) is denoted
197
click to vote
LPNMR
1999
Springer
15 years 10 months ago
1999
Springer
This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action langua...
190
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Sensor networks have been deployed for many barrier coverage applications such as intrusion detection and border surveillance. In these applications, it is critical to o...
151
click to vote
WADS
2007
Springer
16 years 18 days ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
160
click to vote
IPPS
2006
IEEE
16 years 16 days ago
2006
IEEE
The paper presents an approach for the anomaly detection problem based on principles of immune systems. Flexibility and efficiency of the anomaly detection system are achieved by ...