1941 search results - page 109 / 389 » On the Hardness of Approximate Reasoning |
196
click to vote
SAGT
2010
Springer
15 years 4 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...
164
click to vote
DLOG
2008
15 years 8 months ago
2008
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR--a fragment of SROIQ witho...
217
click to vote
ICFEM
2009
Springer
16 years 28 days 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...
182
click to vote
ICML
2010
IEEE
15 years 7 months 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 ...
167
click to vote
FOCS
2006
IEEE
16 years 13 days 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...