76 search results - page 14 / 16 » Subtyping Recursive Games |
100
click to vote
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown t...
126
click to vote
SPIN
2010
Springer
15 years 24 days ago
2010
Springer
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
124
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
103
Voted
CIE
2010
Springer
15 years 6 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...
134
click to vote
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...