Sciweavers

490 search results - page 20 / 98
» Practical Extensions to the IFDS Algorithm
Sort
View
INFOCOM
2008
IEEE
15 years 4 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
ISPD
1997
ACM
186views Hardware» more  ISPD 1997»
15 years 1 months ago
EWA: exact wiring-sizing algorithm
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
Rony Kay, Gennady Bucheuv, Lawrence T. Pileggi
LPAR
2010
Springer
14 years 7 months ago
Counting and Enumeration Problems with Bounded Treewidth
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...
GLOBECOM
2010
IEEE
14 years 7 months ago
On Comparing the Performance of Dynamic Multi-Network Optimizations
With a large variety of wireless access technologies available, multi-homed devices may strongly improve the performance and reliability of communication when using multiple networ...
Geert Jan Hoekstra, Robert D. van der Mei, J. W. B...
CONCURRENCY
2002
99views more  CONCURRENCY 2002»
14 years 9 months ago
A distributed computing environment for interdisciplinary applications
Practical applications are generally interdisciplinary in nature. The technology is well matured for addressing individual discipline applications and not for interdisciplinary ap...
Jerry A. Clarke, Raju R. Namburu