Cellular—neural computations: formal model

A formal model for the fine-grained parallel computations is presented, which combines the connectionist approach of Artificial Neuron Networks with the cellular -like communication structure. The model is based on the concepts and formalities of Parallel Substitution Algorithm, which is considered the most theoretically advanced generalization of Cellular Automaton. Principles...

bandman.pdf6.54 MB

On completeness of mechanism of annotation-directives

An annotated program is a program written down in a programming language extended by the annotations which are formalized comments in the basic programs and relevant for the semantics of the program can be described. The paper focuses on the completeness property of the directive mechanism for different kinds of...

kasyanov.pdf4.31 MB

Effective representation of algorithm for finding a minimal spanning tree of a graph in associative parallel processor

In this paper we analyze two procedures for finding a minimal spanning tree of a graph for an abstract associative STAR-machine with bit-serial processing. These procedures are based on the Prim-Dijkstra algorithm and use different graph representations. We prove their correctness, evaluate their complexity and compare them. In addition, we...

nepomnyashchaya.pdf5.31 MB