Sciweavers

2322 search results - page 13 / 465
» On a game in directed graphs
Sort
View
ISSTA
2004
ACM
14 years 1 months ago
Optimal strategies for testing nondeterministic systems
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
Lev Nachmanson, Margus Veanes, Wolfram Schulte, Ni...
LICS
2008
IEEE
14 years 2 months ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...
AAAI
2010
13 years 10 months ago
Symmetry Detection in General Game Playing
We develop a method for detecting symmetries in arbitrary games and exploiting these symmetries when using tree search to play the game. Games in the General Game Playing domain a...
Stephan Schiffel
JCT
2007
85views more  JCT 2007»
13 years 8 months ago
Avoider-Enforcer games
In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. T...
Dan Hefetz, Michael Krivelevich, Tibor Szabó...
CORR
2010
Springer
125views Education» more  CORR 2010»
13 years 8 months ago
Iterated Regret Minimization in Game Graphs
Iterated regret minimization has been introduced recently by J.Y. Halpern and R. Pass in classical strategic games. For many games of interest, this new solution concept provides s...
Emmanuel Filiot, Tristan Le Gall, Jean-Franç...