500 search results - page 38 / 100 » On the Hardness of Being Truthful |
115
click to vote
FOCS
1995
IEEE
15 years 3 months 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...
SIAMCOMP
1998
14 years 11 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
105
click to vote
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
— The size of data sets being collected and analyzed in the industry for business intelligence is growing rapidly, making traditional warehousing solutions prohibitively expensiv...
124
click to vote
ASPLOS
2004
ACM
15 years 5 months ago
2004
ACM
Embedded software must meet conflicting requirements such as being highly reliable, running on resource-constrained platforms, and being developed rapidly. Static program analysi...
IPSN
2004
Springer
15 years 5 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...