Sciweavers

620 search results - page 47 / 124
» Algorithms and computations on cellular automata
Sort
View
IPPS
1996
IEEE
15 years 4 months ago
A Parallel Algorithm for Minimization of Finite Automata
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...
Bala Ravikumar, X. Xiong
86
Voted
CORR
2008
Springer
89views Education» more  CORR 2008»
15 years 19 days ago
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand...
TSMC
2002
69views more  TSMC 2002»
15 years 5 days ago
A new learning algorithm for the hierarchical structure learning automata operating in the nonstationary S-model random environm
An extended algorithm of the relative reward strength algorithm is proposed. It is shown that the proposed algorithm ensures the convergence with probability 1 to the optimal path ...
Norio Baba, Yoshio Mogami
95
Voted
SC
2004
ACM
15 years 6 months ago
GPU Cluster for High Performance Computing
Inspired by the attractive Flops/dollar ratio and the incredible growth in the speed of modern graphics processing units (GPUs), we propose to use a cluster of GPUs for high perfo...
Zhe Fan, Feng Qiu, Arie E. Kaufman, Suzanne Yoakum...
93
Voted
MCU
2004
105views Hardware» more  MCU 2004»
15 years 1 months ago
Computational Universality in Symbolic Dynamical Systems
Many different definitions of computational universality for various types of systems have flourished since Turing's work. In this paper, we propose a general definition of un...
Jean-Charles Delvenne, Petr Kurka, Vincent D. Blon...