4401 search results - page 601 / 881 » Computing with Default Logic |
147
click to vote
SPIN
2007
Springer
15 years 11 months ago
2007
Springer
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...
142
click to vote
ACSC
2004
IEEE
15 years 9 months ago
2004
IEEE
Table 1 shows the payoff to player one. The same matrix also holds for player two. Player one can gain the maximum 5 points (T = 5) by defection if player two cooperates. However,...
167
click to vote
FSTTCS
2008
Springer
15 years 6 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
153
click to vote
SAC
2008
ACM
15 years 4 months ago
2008
ACM
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...
137
click to vote
CCS
2009
ACM
16 years 5 months ago
2009
ACM
This paper proposes a D-algebra to compose decisions from multiple access control policies. Compared to other algebrabased approaches aimed at policy composition, D-algebra is the...