This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian...
Joel Veness, Kee Siong Ng, Marcus Hutter, David Si...
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
We propose a sample average approximation (SAA) method for stochastic programming problems involving an expected value constraint. Such problems arise, for example, in portfolio s...
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...