800 search results - page 8 / 160 » On the Complexity of Parity Games |
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
MST
2011
13 years 2 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
FAST
2008
13 years 10 months ago
2008
RAID storage systems protect data from storage errors, such as data corruption, using a set of one or more integrity techniques, such as checksums. The exact protection offered by...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current...
AAAI
2012
11 years 10 months ago
2012
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speci...