2957 search results - page 51 / 592 » The Complexity of Polynomial-Time Approximation |
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
WINE
2010
Springer
13 years 5 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...
ICDCS
2002
IEEE
14 years 18 days ago
2002
IEEE
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
HICSS
2008
IEEE
14 years 2 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
ICDT
2005
ACM
14 years 1 months ago
2005
ACM
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...