1450 search results - page 272 / 290 » On the Complexity of Hardness Amplification |
SAC
2010
ACM
13 years 7 months ago
2010
ACM
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
SIGCOMM
2010
ACM
13 years 7 months ago
2010
ACM
Energy efficiency is becoming increasingly important in the operation of networking infrastructure, especially in enterprise and data center networks. While strategies for lowerin...
SIGECOM
2010
ACM
13 years 7 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
SOFTVIS
2010
ACM
13 years 7 months ago
2010
ACM
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
SPAA
2010
ACM
13 years 7 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...