We augment the I/O automaton model of Lynch and Tuttle with probability, as a step toward the ultimate goal of obtaining a useful tool for specifying and reasoning about asynchron...
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...
Gilles Barthe, Marion Daubignard, Bruce M. Kapron,...
abstraction and quantum computation Alessandra Di Pierro1 Dipartimento di Informatica University of Pisa Pisa, Italy Herbert Wiklicky2 Department of Computing Imperial College Lond...
Abstract- This paper presents a comparative study between genetic and probabilistic search approaches of evolutionary computation. They are both applied for optimizing the behavior...
d Abstract) Vladimiro Sassone1 , Karl Krukow2 , and Mogens Nielsen2 1 ECS, University of Southampton 2 BRICS , University of Aarhus We define a mathematical measure for the quantit...