1450 search results - page 74 / 290 » On the Complexity of Hardness Amplification |
SIGECOM
2005
ACM
14 years 2 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
IAT
2009
IEEE
14 years 27 days ago
2009
IEEE
When intelligent systems reason about complex problems with a large hierarchical classification space it is hard to evaluate system performance. For classification problems, differ...
AAAI
2006
13 years 10 months ago
2006
We examine a setting in which a buyer wishes to purchase probabilistic information from some agent. The seller must invest effort in order to gain access to the information, and m...
EKNOW
2009
13 years 6 months ago
2009
As organizations change, their information systems can evolve from simple systems to complex systems, which are hard to understand, and therefore hard to maintain or extend. Proces...
FOCS
1995
IEEE
14 years 18 days ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...