1599 search results - page 33 / 320 » Algorithms for Parity Games |
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
CG
2010
Springer
14 years 7 months ago
2010
Springer
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It ...
66
Voted
AAIM
2006
Springer
15 years 1 months ago
2006
Springer
We investigate LP-polytopes generated by mean payoff games and their properties, including the existence of tight feasible solutions of bounded size. We suggest a new associated al...
IE
2007
14 years 11 months ago
2007
This paper discusses further work on the authors’ “background music reactive games” concept, where background music is used to modify video game parameters and thus actions ...
ITA
2007
14 years 9 months ago
2007
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...