Sciweavers

33 search results - page 4 / 7
» The Interval Liar Game
Sort
View
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 7 months ago
Finite Optimal Control for Time-Bounded Reachability in CTMDPs and Continuous-Time Markov Games
We establish the existence of optimal scheduling strategies for time-bounded reachability in continuous-time Markov decision processes, and of co-optimal strategies for continuous-...
Markus Rabe, Sven Schewe
CSL
2009
Springer
14 years 1 months ago
Decision Problems for Nash Equilibria in Stochastic Games
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
Michael Ummels, Dominik Wojtczak
JSS
2006
127views more  JSS 2006»
13 years 7 months ago
An approach to feature location in distributed systems
This paper describes an approach to the feature location problem for distributed systems, that is, to the problem of locating which code components are important in providing a pa...
Dennis Edwards, Sharon Simmons, Norman Wilde
FSEN
2009
Springer
14 years 1 months ago
The Complexity of Reachability in Randomized Sabotage Games
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
Dominik Klein, Frank G. Radmacher, Wolfgang Thomas
LCN
2008
IEEE
14 years 1 months ago
Covert channels in multiplayer first person shooter online games
Abstract—Covert channels aim to hide the existence of communication between two or more parties. Such channels typically utilise pre-existing (overt) data transmissions to carry ...
Sebastian Zander, Grenville J. Armitage, Philip Br...