1599 search results - page 18 / 320 » Algorithms for Parity Games |
COCO
2007
Springer
15 years 3 months ago
2007
Springer
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
120
click to vote
ALT
2011
Springer
13 years 9 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
FOSSACS
2009
Springer
15 years 4 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—One of the key factors underlying the popularity of Low-density parity-check (LDPC) code is its iterative decoding algorithm that is amenable to efficient hardware implementati...
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
Much recent research has focused on the applications of games with ω-regular objectives in the control and verification of reactive systems. However, many of the game-based model...