Sciweavers

230 search results - page 10 / 46
» UPPAAL-Tiga: Time for Playing Games!
Sort
View
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 1 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
WCNC
2010
IEEE
13 years 5 months ago
Addressing Response Time and Video Quality in Remote Server Based Internet Mobile Gaming
A new remote server based gaming approach, where the responsibility of executing the gaming engines is put on remote servers instead of the mobile devices, has the potential for en...
Shaoxuan Wang, Sujit Dey
DIGRA
2005
Springer
14 years 28 days ago
Growing Complex Games
Do computer simulation games display emergent behavior? Are they models of complex systems or ‘life’ systems? This paper aims to explore and investigate how games studies can ...
Nicholas Glean
FSTTCS
2008
Springer
13 years 8 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
FORMATS
2005
Springer
14 years 28 days ago
On Optimal Timed Strategies
In this paper, we study timed games played on weighted timed automata. In this context, the reachability problem asks if, given a set T of locations and a cost C, Player 1 has a st...
Thomas Brihaye, Véronique Bruyère, J...