2735 search results - page 249 / 547 » Comparing notions of randomness |
MOBICOM
2004
ACM
14 years 4 months ago
2004
ACM
Without realistic modeling of node mobility, simulation evaluation of performance of mobile ad hoc networks may not correlate well with performance in a real deployment. In this p...
SIGMETRICS
2004
ACM
14 years 4 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
WIDM
2004
ACM
14 years 4 months ago
2004
ACM
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...
BIOADIT
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
DATE
2003
IEEE
14 years 4 months ago
2003
IEEE
Test pattern decompression techniques are bounded with the algorithm of test pattern ordering and test data flow controlling. Some of the methods could have more sophisticated sor...