3341 search results - page 163 / 669 » On Bounded Queries and Approximation |
131
Voted
SODA
2003
ACM
15 years 5 months ago
2003
ACM
Zonotopes are centrally symmetric polytopes with a very special structure: they are the Minkowski sum of line segments. In this paper we propose to use zonotopes as bounding volum...
126
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
A long-running difficulty with conventional game theory has been how to modify it to accommodate the bounded rationality of all real-world players. A recurring issue in statistica...
140
click to vote
TCOM
2010
14 years 11 months ago
2010
Abstract--Variable length codes (VLCs), used in data compression, are very sensitive to error propagation in the presence of noisy channels. Addressing this problem with joint sour...
158
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
126
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...