284 search results - page 28 / 57 » Modularity of Completeness Revisited |
ISPW
2009
IEEE
14 years 4 months ago
2009
IEEE
It is usual for work completed at one point in a software development process to be revisited, or reworked, at a later point. Such rework is informally understood, but if we hope t...
ECAL
2005
Springer
14 years 3 months ago
2005
Springer
In this paper, we describe an approach to artificial life, which uses Qualitative Reasoning for the simulation of life within a 3D virtual environment. This system uses qualitative...
STACS
2001
Springer
14 years 2 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
PROVSEC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. In this paper, we study the soundness amplification by repetition of cryptographic protocols. As a tool, we use the Chernoff Information. We specify the number of attempt...
ESOP
2004
Springer
14 years 3 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...