Sciweavers

800 search results - page 52 / 160
» On the Complexity of Parity Games
Sort
View
ACL
2011
13 years 26 days ago
Learning to Win by Reading Manuals in a Monte-Carlo Framework
This paper presents a novel approach for leveraging automatically extracted textual knowledge to improve the performance of control applications such as games. Our ultimate goal i...
S. R. K. Branavan, David Silver, Regina Barzilay
AAAI
2000
13 years 10 months ago
The Game of Hex: An Automatic Theorem Proving Approach to Game Programming
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...
Vadim V. Anshelevich
LICS
2000
IEEE
14 years 1 months ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger
FSTTCS
2008
Springer
13 years 10 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
AAAI
2012
11 years 11 months ago
Learning from Demonstration for Goal-Driven Autonomy
Goal-driven autonomy (GDA) is a conceptual model for creating an autonomous agent that monitors a set of expectations during plan execution, detects when discrepancies occur, buil...
Ben George Weber, Michael Mateas, Arnav Jhala