2412 search results - page 27 / 483 » Which Problems Have Strongly Exponential Complexity |
INFOCOM
2002
IEEE
2002
IEEE
Routing and Wavelength Assignment in WDM Rings with Heterogeneous Wavelength Conversion Capabilities
14 years 2 months ago
—In this paper, we study the routing and wavelength assignment (RWA) tasks in WDM rings with heterogeneous wavelength conversion capabilities. By heterogeneous, we mean that diff...
UAI
2003
13 years 11 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...
CSFW
2011
IEEE
12 years 9 months ago
2011
IEEE
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
DAM
2006
13 years 10 months ago
2006
In the paper, the computational complexity of several variants of the problem of isothermic DNA sequencing by hybridization, is analyzed. The isothermic sequencing is a recent met...
ECOOP
1998
Springer
14 years 2 months ago
1998
Springer
One of the price tags attached to the blessings that OO brings about is a drop in efficiency due to dynamic method dispatch. Much research effort is being spent on the problem of e...