318 search results - page 2 / 64 » Preimage Relations and Their Matrices |
CALCO
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. For any set-endofunctor T : Set → Set there exists a largest subcartesian transformation µ to the filter functor F : Set → Set. Thus we can associate with every T-c...
DATE
2002
IEEE
14 years 13 days ago
2002
IEEE
The core computation in BDD-based symbolic synthesis and verification is forming the image and pre-image of sets of states under the transition relation characterizing the sequen...
ILP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...
IJAC
2008
13 years 7 months ago
2008
: Using recurrence matrices, defined and described with some details, we study a few determinants related to evaluations of binomial coefficients on Dirichlet characters modulo 2, ...
SETA
2010
Springer
13 years 5 months ago
2010
Springer
A Hadamard matrix is said to be completely non-cyclic (CNC) if there are no two rows (or two columns) that are shift equivalent in its reduced form. In this paper, we present three...