1569 search results - page 62 / 314 » Programming contest strategy |
158
click to vote
ISSTA
2004
ACM
15 years 11 months ago
2004
ACM
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
140
click to vote
SIGSOFT
2003
ACM
16 years 6 months ago
2003
ACM
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
219
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
155
click to vote
ACSC
2004
IEEE
15 years 10 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,...
161
click to vote
FOCS
2009
IEEE
16 years 27 days ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriï...