691 search results - page 75 / 139 » Equational Abstractions |
ECCC
2010
13 years 10 months ago
2010
Abstract--There has been a sequence of recent papers devoted to understanding the relation between the testability of properties of Boolean functions and the invariance of the prop...
TNN
1998
13 years 9 months ago
1998
Abstract—It is well known that for finite-sized networks, onestep retrieval in the autoassociative Willshaw net is a suboptimal way to extract the information stored in the syna...
TMC
2012
12 years 13 days ago
2012
Abstract—We consider the problem of relay-assisted transmission for cellular networks. In the considered system, a source node together with n relay nodes are selected in a propo...
IFL
2004
Springer
14 years 3 months ago
2004
Springer
Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
CADE
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. We present the first terminating tableau calculus for basic hybrid logic with the difference modality and converse modalities. The language under consideration is basic m...