Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
Abstract. In this paper we solve the problem of computing exact continuous optimal curves and surfaces for image segmentation and 3D reconstruction, using a maximal flow approach ...
Abstract. Inheritance is one of the key features for the success of objectoriented languages. Inheritance (or specialisation) supports incremental design and re-use of already writ...