Sciweavers

800 search results - page 27 / 160
» On the Complexity of Parity Games
Sort
View
ATAL
2006
Springer
14 years 1 months ago
On using multi-agent systems in playing board games
Computer programs able to play different kinds of games (aka bots) is a growing area of interest for the computer game industry as the demand for better skilled computerized oppon...
Stefan J. Johansson
FSTTCS
2008
Springer
13 years 10 months ago
Average-Time Games
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 ...
Marcin Jurdzinski, Ashutosh Trivedi
BCSHCI
2007
13 years 10 months ago
Calling time: an effective and affective evaluation of two versions of the MIT Beer Game
Playing a business game needs to be both educational and entertaining. Thus, evaluation of the experience of playing games needs to incorporate both effective and affective dimens...
Nicola Millard, Rosalind Britton
STOC
1997
ACM
116views Algorithms» more  STOC 1997»
14 years 1 months ago
Direct Product Results and the GCD Problem, in Old and New Communication Models
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
Itzhak Parnafes, Ran Raz, Avi Wigderson
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 9 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...