16404 search results - page 27 / 3281 » A set coverage problem |
143
click to vote
WADS
2007
Springer
16 years 17 hour ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
150
click to vote
SUTC
2006
IEEE
15 years 12 months ago
2006
IEEE
We propose and formally characterize a new problem named the dynamic context coverage problem in capabilityconstrained mobile sensor network environments. The goal is to move and ...
208
click to vote
IFIP
2001
Springer
15 years 10 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
136
click to vote
HPCC
2007
Springer
16 years 2 days ago
2007
Springer
Abstract. Service discovery is a crucial feature for the usability of mobile ad-hoc networks (MANETs). In this paper, Minimum Dominating Forward Node Set based Service Discovery Pr...
165
click to vote
APSEC
2005
IEEE
15 years 11 months ago
2005
IEEE
Testing a large-scale, real-life commercial software application is a very challenging task due to the constant changes in the software, the involvement of multiple programmers an...