916 search results - page 42 / 184 » Distributed Construction of a Fault-Tolerant Network from a ... |
117
Voted
FLAIRS
2009
14 years 11 months ago
2009
In this paper, we put forth the first join tree propagation algorithm that selectively applies either arc reversal (AR) or variable elimination (VE) to build the propagated messag...
126
click to vote
ASPDAC
2006
ACM
15 years 8 months ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
116
click to vote
WWW
2004
ACM
16 years 2 months ago
2004
ACM
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
UAI
2004
15 years 3 months ago
2004
We present new MCMC algorithms for computing the posterior distributions and expectations of the unknown variables in undirected graphical models with regular structure. For demon...
117
click to vote
EUROPAR
2004
Springer
15 years 7 months ago
2004
Springer
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...