Results 261 to 270 of about 54,023 (317)

Structured Dynamics in the Algorithmic Agent. [PDF]

Entropy (Basel)
Ruffini G, Castaldo F, Vohryzek J.
europepmc   +1 more source

Augmenting Databases with Generalized Transitive Closure

, 2012
Shaul Dar
openalex   +1 more source

Indigenous Community Views of Disability in Canada: Protocol for a Scoping Review.

JMIR Res Protoc
Rojas-Cárdenas A, Cleaver S, Sarmiento I, Rock J, Grenier Y, Charrier F, Gosselin RA, Cockcroft A, Andersson N.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A Transition Closure Model for Predicting Transition Onset

SAE Technical Paper Series, 1997
<div class="htmlview paragraph">A unified approach which makes it possible to determine the extent and onset of transition in one calculation is presented. It treats the laminar fluctuations in a manner similar to that used in describing turbulence. As a result, the complete flowfield can be calculated using existing CFD codes and without the use
E. S. Warren, H. A. Hassan
openaire   +2 more sources

Aggregative closure: an extension of transitive closure

[1989] Proceedings. Fifth International Conference on Data Engineering, 2003
The aggregative closure operator is defined and its usefulness is demonstrated in a wide variety of applications. The concepts and definitions of closed semirings and the aggregating relational operators provide a mathematical framework for the presentation of algorithms for these applications.
I.F. Cruz, T.S. Norvell
openaire   +1 more source

Polynomial Space and Transitive Closure

SIAM Journal on Computing, 1979
A characterization of PSPACE in terms of the regular sets and certain algebraic closure operations is developed. It is shown that NP = PSPACE if and only if NP is closed under a form of the transitive closure operation.
openaire   +2 more sources

High-Probability Parallel Transitive-Closure Algorithms

SIAM Journal on Computing, 1990
There is a straightforward algorithm for computing the transitive-closure of an n-node graph in $O(\log ^2 n)$ time on an EREW-PRAM, using $n^3 / \log n$ processors, or indeed with $M(n) / \log n$ processors if serial matrix multiplication in $M(n)$ time can be done. This algorithm is within a log factor of optimal in work (processor-time product), for
J. Ullman, M. Yannakakis
openaire   +2 more sources

Algorithms for transitive closure

Information Processing Letters, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Koubková, A., Koubek, V.
openaire   +1 more source