Sciweavers

5171 search results - page 28 / 1035
» Deterministic Parallel Processing
Sort
View
IMSCCS
2006
IEEE
14 years 1 months ago
Explicitly Parallel Regular Expressions
The equivalence of non-deterministic finite automata (NFA1 ), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented r...
Brett D. Estrade, A. Louise Perkins, John M. Harri...
EJC
2007
13 years 7 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...