40 search results - page 6 / 8 » Concurrent Games and Full Completeness |
AMAST
1991
Springer
14 years 3 days ago
1991
Springer
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
SIGECOM
2005
ACM
14 years 2 months ago
2005
ACM
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
FOSSACS
2003
Springer
14 years 1 months ago
2003
Springer
Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe th...
CCS
2009
ACM
14 years 3 months ago
2009
ACM
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
ACS
2007
13 years 8 months ago
2007
Abstract. For a symmetric monoidal-closed category X and any object K, the category of K-Chu spaces is small-topological over X and small cotopological over Xop . Its full subcateg...