5158 search results - page 180 / 1032 » Generalization of the Dempster-Shafer Theory |
270
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
152
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
182
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
156
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
172
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
This paper introduces a multiagent reinforcement learning algorithm that converges with a given accuracy to stationary Nash equilibria in general-sum discounted stochastic games. ...