27 search results - page 2 / 6 » Polynomial Methods for Allocating Complex Components |
ECRTS
2009
IEEE
13 years 2 months ago
2009
IEEE
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
WINE
2010
Springer
13 years 2 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
Abstract—We aim to enhance the end-to-end rate of a general dual-hop relay network with multiple channels and finite modulation formats, by jointly optimizing channel pairing, p...
JSC
2010
13 years 3 months ago
2010
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
UAI
2003
13 years 6 months ago
2003
Real-world distributed systems and networks are often unreliable and subject to random failures of its components. Such a stochastic behavior affects adversely the complexity of o...