356 search results - page 48 / 72 » Graph Games on Ordinals |
IAT
2010
IEEE
14 years 7 months ago
2010
IEEE
Intention recognition has significant applications in ambient intelligence, for example in assisted living and care of the elderly, in games and in intrusion and other crime detec...
82
Voted
ISSTA
2004
ACM
15 years 3 months ago
2004
ACM
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...
104
click to vote
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
69
Voted
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
LICS
1997
IEEE
15 years 1 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...