Abstract. Finding optimal policies for general partially observable Markov decision processes (POMDPs) is computationally difficult primarily due to the need to perform dynamic-pr...
Let κ < λ be regular uncountable cardinals. Using a finite support iteration of ccc posets we obtain the consistency of b = a = κ < s = λ. If µ is a measurable cardinal...
Various image restoration methods have been studied for removing space-variant motion blur such as iterative and POCS method. However, their computational complexity of the method...
We explore a structuring mechanism for reactive systems, based on two ideas: array iterators allow the description of regular systems; logical-time contracts allow local or global...
We consider planning in a Markovian decision problem, i.e., the problem of finding a good policy given access to a generative model of the environment. We propose to use fitted Q-i...
Amir Massoud Farahmand, Mohammad Ghavamzadeh, Csab...