Abstract. We consider the problem of sequence prediction in a probabilistic setting. Let there be given a class C of stochastic processes (probability measures on the set of one-wa...
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
A fundamental assumption often made in supervised classification is that the problem is static, i.e. the description of the classes does not change with time. However many practi...
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
—Adaptive educational hypermedia allows lessons to be personalized according to the needs of the learner. However, to achieve this, content must be split into stand-alone fragmen...
Jonathan G. K. Foss, Alexandra I. Cristea, Maurice...