10890 search results - page 1832 / 2178 » Automatic Complexity Analysis |
183
click to vote
ADHOCNOW
2005
Springer
16 years 6 days ago
2005
Springer
We present the Ad-hoc On-demand Secure Routing (AOSR) protocol, which uses pairwise shared keys between pairs of mobile nodes and hash values keyed with them to verify the validity...
191
click to vote
CBSE
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Predicting the performance of component-based applications is difficult due to the complexity of the underlying component technology. This problem is exacerbated when a m...
208
click to vote
CPM
2005
Springer
16 years 5 days ago
2005
Springer
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....
180
click to vote
DCOSS
2005
Springer
16 years 5 days 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 ...
184
click to vote
DCOSS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...