We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
Abstract. We axiomatically characterise a class of algorithms for making sequential decisions in situations of complete ignorance. These algorithms assume that a decision maker (DM...
Event processing systems have wide applications ranging from managing events from RFID readers to monitoring RSS feeds. Consequently, there exists much work on them in the literat...
Walker M. White, Mirek Riedewald, Johannes Gehrke,...
In this paper, a unified framework for representing uncertain information based on the notion of an interval structure is proposed. It is shown that the lower and upper approximat...
: This paper develops a theory of probabilistic models for risky choices. Part of this theory can be viewed as an extension of the expected utility theory to account for bounded ra...