1450 search results - page 14 / 290 » On the Complexity of Hardness Amplification |
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
OPODIS
2007
13 years 9 months ago
2007
This report describes a necessary and sufficient test for the schedulability of a set of sporadic harddeadline tasks on a multiprocessor platform, using any of a variety of schedu...
WISES
2003
13 years 9 months ago
2003
Abstract — Control systems are often software-intensive applications that are becoming extremely complex as new functionality is required. Complexity is a real engineering challe...
FOCS
2008
IEEE
13 years 7 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
We describe a novel max-margin parameter learning approach for structured prediction problems under certain non-decomposable performance measures. Structured prediction is a commo...