1450 search results - page 193 / 290 » On the Complexity of Hardness Amplification |
MOBIHOC
2009
ACM
14 years 4 months ago
2009
ACM
Spectrum is a critical yet scarce resource and it has been shown that dynamic spectrum access can significantly improve spectrum utilization. To achieve this, it is important to ...
WCRE
2009
IEEE
14 years 4 months ago
2009
IEEE
—Code smells are poor implementation choices, thought to make object-oriented systems hard to maintain. In this study, we investigate if classes with code smells are more change-...
IPPS
2009
IEEE
14 years 4 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
ATAL
2009
Springer
14 years 4 months ago
2009
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...
COCO
2009
Springer
14 years 4 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...