673 search results - page 37 / 135 » Approximate coherence-based reasoning |
117
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...
116
click to vote
SAGT
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
131
click to vote
ICFEM
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
108
click to vote
ICML
2010
IEEE
15 years 29 days ago
2010
IEEE
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...