Abstract. A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions speci...
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...
Alexis-Julien Bouquet, Olivier Serre, Igor Walukie...
Current approaches to adaptive game AI require either a high quality of utilised domain knowledge, or a large number of adaptation trials. These requirements hamper the goal of rap...
Sander Bakkes, Pieter Spronck, H. Jaap van den Her...
We describe the class of games with opacity condition, as an adequate model for security aspects of computing systems. We study their theoretical properties, relate them to reachab...
Abstract. For real time object recognition and tracking often color-based methods are used. While these methods are very efficient, they usually dependent heavily on lighting cond...
Thilo Weigel, Dapeng Zhang 0002, Klaus Rechert, Be...