4255 search results - page 36 / 851 » Cover |
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
We study the cover time of a random walk on the random digraph Dn,p when np =
DCOSS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
DCOSS
2010
Springer
13 years 7 months ago
2010
Springer
Synchronization is widely considered as an important service in distributed systems which may simplify protocol design. Phase clock is a general synchronization tool that provides ...
DM
2008
13 years 7 months ago
2008
A covering array CA(N; t, k, v) is an N