ACRI
2004
Springer
14 years 5 months ago
2004
Springer
We have investigated a problem where the goal is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type OBSTACLE, EMPTY or CRE...
PACT
2005
Springer
14 years 5 months ago
2005
Springer
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
ACRI
2006
Springer
14 years 5 months ago
2006
Springer
The goal of our investigation is to find automatically the absolutely best rule for a moving creature in a cellular field. The task of the creature is to visit all empty cells wi...
GLOBECOM
2007
IEEE
14 years 5 months ago
2007
IEEE
—This article presents a novel mechanism to perform packet content inspection by longest prefix matching (LPM) technology. It is done by transforming the automaton-based state ta...