Sciweavers

412 search results - page 26 / 83
» A New Proof of the F5 Algorithm
Sort
View
CAV
1998
Springer
130views Hardware» more  CAV 1998»
15 years 2 months ago
On Checking Model Checkers
It has become good practice to expect authors of new model checking algorithms to provide not only rigorous evidence of the algorithms correctness, but also evidence of their pract...
Gerard J. Holzmann
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
14 years 9 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant
STOC
2007
ACM
102views Algorithms» more  STOC 2007»
15 years 10 months ago
Zero-knowledge from secure multiparty computation
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
AGP
1995
IEEE
15 years 1 months ago
A Prolog Implementation of Kem
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
Alberto Artosi, Paola Cattabriga, Guido Governator...
EVOW
2011
Springer
14 years 1 months ago
Towards Procedural Strategy Game Generation: Evolving Complementary Unit Types
The Strategy Game Description Game Language (SGDL) is intended to become a complete description of all aspects of strategy games, including rules, parameters, scenarios, maps, and ...
Tobias Mahlmann, Julian Togelius, Georgios N. Yann...