A maximal prime subgraph decomposition junction tree (MPD-JT) is a useful computational structure that facilitates lazy propagation in Bayesian networks (BNs). A graphical method ...
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
We consider a variant of the two node tandem Jackson network where the upstream server reduces its service rate when the downstream queue exceeds some prespecified threshold. The...
A constant gap between the deterministic model of a class of a wireless relay network and its Gaussian model counterpart is derived. The method is constructive in the sense that a ...
Coordinates-based distance prediction algorithms can improve the performance of many Internet applications, especially in the peer-to-peer architecture and overlay construction. B...
Lin Cong, Yang Chen, Xiaohui Shi, Ye Wang, Weiyu W...