We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
In many applications surfaces with a large number of primitives occur. Geometry compression reduces storage space and transmission time for such models. A special case is given by...
Information visualization, aided by ever more accessible computational resources, continues to grow in popularity and significance. The capability to generate complex imagery by ...
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
Abstract. In this paper we introduce SYGo, an innovative hide-andseek game which is part of the AMOGA research project of the University of Bonn in cooperation with and funded by D...