3406 search results - page 6 / 682 » Computational models of classical conditioning |
DCC
2006
IEEE
14 years 8 months ago
2006
IEEE
We construct various classes of low-density parity-check codes using point-line incidence structures in the classical projective plane PG(2, q). Each incidence structure is based ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
A wide variety of models for concurrent programs has been proposed during the past decades, each one focusing on various aspects of computations: trace equivalence, causality betwe...
ISMVL
2003
IEEE
14 years 1 months ago
2003
IEEE
In earlier work [9], we defined CTL model-checking over finite-valued logics with De Morgan negation. In this paper, we extend this work to logics with intuitionistic, Galois an...
RSA
2010
13 years 7 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
TCS
2010
13 years 7 months ago
2010
We compare how computational effects are modelled in Classical Domain Theory and Topological Domain Theory. Both of these theories provide powerful toolkits for denotational sema...