14 search results - page 3 / 3 » Fast Periodic Graph Exploration with Constant Memory |
SIGMETRICS
2010
ACM
13 years 3 months ago
2010
ACM
We introduce and analyze a deterministic fluid model that serves as an approximation for the Gt/GI/st + GI manyserver queueing model, which has a general time-varying arrival pro...
BMCBI
2008
13 years 5 months ago
2008
Background: Much effort is currently made to develop the Gene Ontology (GO). Due to the dynamic nature of information it addresses, GO undergoes constant updates whose results are...
STACS
1992
Springer
13 years 9 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
ICDCSW
2003
IEEE
13 years 10 months ago
2003
IEEE
Nodes in ad hoc networks generally transmit data at regular intervals over long periods of time. Recently, ad hoc network nodes have been built that run on little power and have v...