Sciweavers

914 search results - page 44 / 183
» Branch and Bound on the Network Model
Sort
View
59
Voted
CORR
2007
Springer
69views Education» more  CORR 2007»
14 years 9 months ago
Wireless Network Information Flow
— We present an achievable rate for general deterministic relay networks, with broadcasting at the transmitters and interference at the receivers. In particular we show that if t...
Amir Salman Avestimehr, Suhas N. Diggavi, David N....
AAAI
2006
14 years 11 months ago
A Characterization of Interventional Distributions in Semi-Markovian Causal Models
We offer a complete characterization of the set of distributions that could be induced by local interventions on variables governed by a causal Bayesian network of unknown structu...
Jin Tian, Changsung Kang, Judea Pearl
CORR
2011
Springer
163views Education» more  CORR 2011»
14 years 4 months ago
Statistical Analysis of Link Scheduling on Long Paths
We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministi...
Yashar Ghiassi-Farrokhfal, Jörg Liebeherr, Al...
ICCCN
2008
IEEE
15 years 4 months ago
Localized Access Point Association in Wireless LANs with Bounded Approximation Ratio
— The current access point (AP) association schemes in wireless LANs, such as IEEE 802.11, cause an unbalanced load which reduces the performance of both the entire network and i...
Mingming Lu, Jie Wu
SPAA
2004
ACM
15 years 3 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter