48 search results - page 7 / 10 » The Winning Ways of Concurrent Games |
CIE
2010
Springer
14 years 4 days ago
2010
Springer
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
ROBOCUP
1998
Springer
13 years 11 months ago
1998
Springer
The CMUnited-98 simulator team became the 1998 RoboCup simulator league champion by winning all 8 of its games, outscoring opponents by a total of 66{0. CMUnited-98 builds upon the...
AIM
2000
13 years 7 months ago
2000
The CMUnited-98 simulator team became the 1998 RoboCup simulator league champion by winning all 8 of its games, outscoring opponents by a total of 66 0. CMUnited-98 builds upon the...
LPAR
2004
Springer
14 years 21 days ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
CIE
2010
Springer
13 years 11 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...