3455 search results - page 13 / 691 » Generalized Game Trees |
ICML
2000
IEEE
15 years 11 months ago
2000
IEEE
Stochastic games are a generalization of MDPs to multiple agents, and can be used as a framework for investigating multiagent learning. Hu and Wellman (1998) recently proposed a m...
IE
2007
14 years 11 months ago
2007
By blurring the boundary between game fiction and reality, Pervasive Games impact the shared space of the city areas that they use as gaming platform. Drawing on notions of spatia...
89
Voted
AAAI
1996
14 years 11 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...
CCL
1994
Springer
15 years 2 months ago
1994
Springer
We employ the model-theoretic method of Ehrenfeucht-Fra sse Games to prove the completeness of the theory CFT, which has been introduced in 22] for describing rational trees in a ...
DM
2008
14 years 10 months ago
2008
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...