Sciweavers

2421 search results - page 39 / 485
» Approximate Flow-Aware Networking
Sort
View
ICC
2008
IEEE
118views Communications» more  ICC 2008»
15 years 4 months ago
Bounded-Variance Network Calculus: Computation of Tight Approximations of End-to-End Delay
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
Paolo Giacomazzi, Gabriella Saddemi
INFOCOM
2009
IEEE
15 years 4 months ago
Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
Hung Q. Ngo, Thanh-Nhan Nguyen, Dahai Xu
MOBIHOC
2008
ACM
15 years 9 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha...
BMCBI
2008
130views more  BMCBI 2008»
14 years 10 months ago
Function approximation approach to the inference of reduced NGnet models of genetic networks
Background: The inference of a genetic network is a problem in which mutual interactions among genes are deduced using time-series of gene expression patterns. While a number of m...
Shuhei Kimura, Katsuki Sonoda, Soichiro Yamane, Hi...
UAI
1998
14 years 11 months ago
Large Deviation Methods for Approximate Probabilistic Inference
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr childjparents depend monotonically on weighted sums of the parents. In larg...
Michael J. Kearns, Lawrence K. Saul