803 search results - page 33 / 161 » Independence in Direct-Product Graphs |
JMLR
2010
13 years 2 months ago
2010
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transfor...
FCT
2009
Springer
14 years 2 months ago
2009
Springer
The n-ary first and second recursion theorems formalize two distinct, yet similar, notions of self-reference. Roughly, the n-ary first recursion theorem says that, for any n algo...
ICLP
1989
Springer
1989
Springer
Complete and Efficient Methods for Supporting Side-effects in Independent/Restricted AND-Parallelism
13 years 11 months ago
It has been shown that it is possible to exploit Independent/Restricted And-parallelism in logic programs while retaining the conventional "don't know" semantics of...
GD
2009
Springer
14 years 1 days ago
2009
Springer
We show that cr(G) ≤ 2 iocr(G) 2 settling an open problem of Pach and T´oth [4, 1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2. 1 Crossing Numbers Pach and T´oth point out in ...
ECEASST
2008
13 years 7 months ago
2008
: The main idea behind Reconfigurable Object Nets (RONs) is to support the visual specification of controlled rule-based net transformations of place/transition nets (P/T nets). RO...