3946 search results - page 103 / 790 » The computational complexity of choice sets |
287
click to vote
ICAART
2010
INSTICC
16 years 3 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
169
click to vote
TCS
2008
15 years 6 months ago
2008
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
189
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Many recognition algorithms depend on careful positioning of an object into a canonical pose, so the position of features relative to a fixed coordinate system can be examined. Cu...
156
click to vote
CRYPTO
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
181
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...