Search

Your search keyword '"Clarridge, Adam"' showing total 6 results
Start Over Author "Clarridge, Adam"
6 results on '"Clarridge, Adam"'

1. A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule

Author

Clarridge, Adam, Salomaa, Kai, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Maneth, Sebastian, editor

Published
2009
Full Text
View/download PDF

2. A Cryptosystem Based on the Composition of Reversible Cellular Automata

Author

Clarridge, Adam, Salomaa, Kai, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Dediu, Adrian Horia, editor, Ionescu, Armand Mihai, editor, and Martín-Vide, Carlos, editor

Published
2009
Full Text
View/download PDF

6. An Improved Cellular Automata Based Algorithm for the 45-Convex Hull Problem.

Author

CLARRIDGE, ADAM G. and SALOMAA, KAI

Subjects
*CELLULAR automata, *ALGORITHMS, *COMMUNICATION, *POLYGONS, *CONVEX functions
Abstract

We give a cellular automaton algorithm for solving a version of the convex hull problem. The algorithm is based on the one presented by Torbey and Akl which requires a global transition rule change in order to complete its operation. By introducing several new stales and giving a simpler set of transition rules, we lift the requirement for a global rule change in between the previous algorithm's shrinking and expanding stages. The algorithm uses several communication states to explicitly detect when the first (shrinking) stage has ended, and relying only on local state information the cellular automaton is able to begin the next (expanding) stage of the computation in such a way that correctness is ensured. [ABSTRACT FROM AUTHOR]

Published
2010

Catalog

Books, media, physical & digital resources
See catalog results