1912 search results - page 241 / 383 » On the evaluation of argumentation formalisms |
160
click to vote
AI
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This paper investigates the methods for learning predictive classifiers based on Bayesian belief networks (BN) – primarily unrestricted Bayesian networks and Bayesian m...
145
click to vote
APN
2001
Springer
15 years 11 months ago
2001
Springer
Reachability analysis and simulation tools for high-level nets spend a significant amount of the computing time in performing enabling tests, determining the assignments under whi...
176
click to vote
COLT
2000
Springer
15 years 10 months ago
2000
Springer
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...
180
click to vote
CPM
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Ambiguity in dynamic programming arises from two independent sources, the non-uniqueness of optimal solutions and the particular recursion scheme by which the search spac...
193
click to vote
ICFP
1998
ACM
15 years 10 months ago
1998
ACM
We present a purely functional implementation of the computational differentiation tools — the well known numeric (i.e., not symbolic) techniques which permit one to compute poin...