1941 search results - page 256 / 389 » On the Hardness of Approximate Reasoning |
163
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings. Bidders have publicly observable attributes, and we assume that the valuation...
210
click to vote
WADS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
149
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...
161
click to vote
WADS
1997
Springer
15 years 10 months ago
1997
Springer
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
152
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...