This paper presents a natural extension of stagewise ranking to the the case of infinitely many items. We introduce the infinite generalized Mallows model (IGM), describe its prop...
This paper presents extensions of Safraless algorithms proposed in the literature for automata on infinite untimed words to the case of automata on infinite timed words.
Barbara Di Giampaolo, Gilles Geeraerts, Jean-Fran&...
This paper steps back from the standard infinite horizon formulation of reinforcement learning problems to consider the simpler case of finite horizon problems. Although finite ho...
: Interval algebra networks are traditionally defined over finite intervals. In this paper, we relax this restriction by allowing one or more of the intervals involved to be infini...
We describe a nilpotent quotient algorithm for a certain type of infinite presentations: the so-called finite L-presentations. We then exhibit finite L-presentations for various i...