1503 search results - page 8 / 301 » Generalized Parity Games |
CORR
2006
Springer
13 years 9 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...
PDPTA
2004
13 years 10 months ago
2004
Highly available storage uses replication and other redundant storage to recover from a component failure. If parity data calculated from an erasure correcting code is not updated...
IJON
2002
13 years 8 months ago
2002
In this paper, the N-bit parity problem is solved with a neural network that allows direct connections between the input layer and the output layer. The activation function used i...
IANDC
2006
13 years 9 months ago
2006
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
SIAMCOMP
2008
13 years 9 months ago
2008
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...