Sciweavers

62 search results - page 8 / 13
» Minimizing Complexity in Cellular Automata Models of Self-Re...
Sort
View
IPPS
1996
IEEE
13 years 11 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
PDPTA
2010
13 years 5 months ago
Data-Parallelism and GPUs for Lattice Gas Fluid Simulations
Lattice gas cellular automata (LGCA) models provide a relatively fast means of simulating fluid flow and can give both quantitative and qualitative insights into flow patterns aro...
Mitchel Johnson, Daniel P. Playne, Kenneth A. Hawi...
ATAL
2010
Springer
13 years 8 months ago
How important are updating schemes in multi-agent systems? An illustration on a multi-turmite model
It is to date an open question to know how the updating methods affect the evolution of a multi-agent system. This question has been tackled for various complex systems such as ce...
Nazim Fatès, Vincent Chevrier
TITB
2008
109views more  TITB 2008»
13 years 7 months ago
Automatic Segmentation of High-Throughput RNAi Fluorescent Cellular Images
High throughput genome-wide RNAi screening is emerging as an essential tool to assist biologists in understanding complex cellular processes. The large number of images produced in...
Pingkun Yan, Xiaobo Zhou, Mubarak Shah, Stephen T....
BMCBI
2010
143views more  BMCBI 2010»
13 years 7 months ago
An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location inf
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...
Kaname Kojima, Masao Nagasaki, Satoru Miyano