336 search results - page 13 / 68 » Approximating Transitivity in Directed Networks |
CORR
2011
Springer
13 years 1 months ago
2011
Springer
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
VLSID
1999
IEEE
13 years 11 months ago
1999
IEEE
Recently Lillis, et al. presented an elegant dynamic programming approach to RC interconnect delay optimization through driver sizing, repeater insertion, and, wire sizing which e...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
—The capacity region of multihop wireless network is involved in many capacity optimization problems. However, the membership of the capacity region is NP-complete in general, an...
DIALM
2008
ACM
13 years 9 months ago
2008
ACM
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
ICC
2008
IEEE
14 years 1 months ago
2008
IEEE
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...