109 search results - page 12 / 22 » Explaining How to Play Real-Time Strategy Games |
81
Voted
CIE
2010
Springer
15 years 3 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
99
Voted
ICALP
2000
Springer
15 years 3 months ago
2000
Springer
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of ...
95
Voted
AAAI
2000
15 years 1 months ago
2000
The game of Hex is a two-player game with simple rules, a deep underlying mathematical beauty, and a strategic complexity comparable to that of Chess and Go. The massive game-tree...
118
Voted
ATAL
2011
Springer
13 years 11 months ago
2011
Springer
The field of multiagent decision making is extending its tools from classical game theory by embracing reinforcement learning, statistical analysis, and opponent modeling. For ex...
108
click to vote
JAIR
2008
14 years 11 months ago
2008
In this paper, we elucidate the equivalence between inference in game theory and machine learning. Our aim in so doing is to establish an equivalent vocabulary between the two dom...