788 search results - page 109 / 158 » Symbolic Equivalence Checking |
115
click to vote
TNN
2008
15 years 3 months ago
2008
Abstract-- A major drawback of artificial neural networks (ANNs) is their black-box character. This is especially true for recurrent neural networks (RNNs) because of their intrica...
114
click to vote
TPLP
2008
15 years 3 months ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
127
click to vote
VTC
2010
IEEE
15 years 1 months ago
2010
IEEE
— The performance of multihop links is studied in this contribution by both analysis and simulations, when communicating over Generalized-K (KG) fading channels. The performance ...
143
click to vote
JUCS
2010
14 years 10 months ago
2010
: We initiate in this work the study of a sort of redundancy problem revealed by what we call redundant relations. Roughly, we define a redundant relation in a database instance (d...
121
Voted
TACAS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...