258 search results - page 16 / 52 » Loops: Relevant or Redundant |
SIGCOMM
2005
ACM
14 years 1 months ago
2005
ACM
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
GLVLSI
2010
IEEE
13 years 9 months ago
2010
IEEE
For timing-driven or yield-driven designs, non-tree routing has become more and more popular and additional loops provide the redundant paths to protect against the effect of the ...
SIGIR
2003
ACM
14 years 1 months ago
2003
ACM
Previous research in novelty detection has focused on the task of finding novel material, given a set or stream of documents on a certain topic. This study investigates the more ...
ISHPC
1999
Springer
14 years 13 hour ago
1999
Springer
Abstract. Dynamic program optimization is the only recourse for optimizing compilers when machine and program parameters necessary for applying an optimization technique are unknow...
KR
2010
Springer
14 years 16 days ago
2010
Springer
We present a distributed algorithm for computing equilibria of heterogeneous nonmonotonic multi-context systems (MCS). The algorithm can be parametrized to compute only partial eq...