نشرت في: 2000
This paper presents a complete theory of credal networks, structures that associate convex sets of probability measures with directed acyclic graphs....
The chessmaps heuristic is a pattern-oriented approach to ordering moves for the game of chess. It uses a neural network to learn a relation between...
In this paper, we extend the theory of abstract argumentation systems proposed by Vreeswijk (1997). This framework stands at a high abstraction level...
The Minimum Description Length (MDL) principle is solidly based on a provably ideal method of inference using Kolmogorov complexity. We test how the...
We present a new algorithm for polynomial time learning of optimal behavior in single-controller stochastic games. This algorithm incorporates and in...
