Abstract. Consider an agent executing a plan with nondeterministic actions, in a dynamic environment, which might fail. Suppose that she is given a description of this action domai...
Thomas Eiter, Esra Erdem, Wolfgang Faber, Já...
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...
Abstract—The deployment of multimedia services in nextgeneration networks is a challenge due to the high configuration complexity of the streaming process in different stationary...
Teodora Guenkova-Luy, Holger Schmidt, Andreas Scho...
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...