192 search results - page 7 / 39 » Complexity Bounds for Regular Games |
AAAI
1996
13 years 10 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
LICS
2012
IEEE
11 years 11 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
ITA
2002
13 years 8 months ago
2002
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the be...
EWCBR
2008
Springer
13 years 10 months ago
2008
Springer
We present an approach to visualize textual case bases by "stacking" similar cases and features close to each other in an image derived from the casefeature matrix. We pr...
STACS
2004
Springer
14 years 2 months ago
2004
Springer
An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo ...