1279 search results - page 17 / 256 » Fast Implementations of Automata Computations |
JPDC
2006
13 years 7 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
SBACPAD
2003
IEEE
14 years 24 days ago
2003
IEEE
This paper presents a theoretical study to evaluate the performance of a family of parallel implementations of the propagation algorithm. The propagation algorithm is used to an i...
EGC
2005
Springer
14 years 1 months ago
2005
Springer
Computational grid provides a platform for exploiting various computational resources over wide area networks. One of the concerns in implementing computational grid environment is...
IPPS
1996
IEEE
13 years 11 months ago
1996
IEEE
In this paper, we present a parallel algorithm for the minimization of deterministic finite state automata (DFA's) and discuss its implementation on a connection machine CM-5...
IEEEICCI
2008
IEEE
14 years 1 months ago
2008
IEEE
—A new abstract model of computation, the computational manifold, provides a framework for approaching the problems of consciousness, awareness, cognition and symbolic processing...