Sciweavers

2863 search results - page 159 / 573
» Constructing minimum-interference networks
Sort
View
103
Voted
FLAIRS
2001
15 years 4 months ago
Maximal Prime Subgraph Decomposition of Bayesian Networks
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 ...
Kristian G. Olesen, Anders L. Madsen
136
Voted
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
15 years 4 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
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 ...
S. Thomas McCormick, Akiyoshi Shioura
QUESTA
2007
103views more  QUESTA 2007»
15 years 2 months ago
Large deviations and importance sampling for a tandem network with slow-down
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...
Paul Dupuis, Kevin Leder, Hui Wang
121
Voted
GLOBECOM
2010
IEEE
15 years 1 months ago
Transmission Strategies for Gaussian Relay Networks Obtained from Deterministic Models
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 ...
Nicolas Schrammar, Mikael Skoglund
GCC
2007
Springer
15 years 9 months ago
Telemeter: Network Distance Prediction Base on Network Topology
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...