not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
Planning in partially-observable dynamical systems (such as POMDPs and PSRs) is a computationally challenging task. Popular approximation techniques that have proved successful ar...
Michael R. James, Michael E. Samples, Dmitri A. Do...
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
We suggest a recurrent neural network (RNN) model with a recurrent part corresponding to iterative function systems (IFS) introduced by Barnsley 1] as a fractal image compression ...
We introduce a general framework for reasoning with prioritized propositional data by aggregation of distance functions. Our formalism is based on a possible world semantics, wher...