๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An improved algorithm for computing topological entropy

โœ Scribed by Louis Block; James Keesling; Shihai Li; Kevin Peterson

Publisher
Springer
Year
1989
Tongue
English
Weight
427 KB
Volume
55
Category
Article
ISSN
0022-4715

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Improved Algorithm for Module Allocat
An Improved Algorithm for Module Allocation in Distributed Computing Systems
โœ Ajith Tom P.; C. Siva Ram Murthy ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 159 KB

We consider the problem of finding an optimal and sub-optimal allocation of program modules onto processors of a distributed computing system. A module causes two types of cost to be incurred at the processor to which it is allocated-an execution cost for processing the module, and a communication c

Algorithm for computer perception of top
Algorithm for computer perception of topological symmetry
โœ Chang-Yu Hu; Lu Xu ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 569 KB

For the exhaustive and irredundant generation of candidate structures in ESESOC (Expert System for the Elucidation of the Structures of Organic Compounds), a new algorithm for computer perception of topological equivalence classes of the nodes (non-hydrogen atoms) in molecular graphs or partial stru

An Algorithm for Computing Graded Algebr
An Algorithm for Computing Graded Algebras
โœ Michael Vaughan-Lee ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 391 KB

In this article I describe an algorithm for computing finite dimensional graded algebras, and I describe an implementation of the algorithm. As an application of the algorithm, I investigate associative algebras satisfying the identity \(x^{4}=0\). I show that if \(A\) is an associative algebra over