Sciweavers

11 search results - page 1 / 3
» Cryptography by Cellular Automata or How Fast Can Complexity...
Sort
View
ICS
2010
Tsinghua U.
14 years 1 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
AUSAI
2006
Springer
13 years 8 months ago
Data Clustering and Visualization Using Cellular Automata Ants
This paper presents two novel features of an emergent data visualization method coined "cellular ants": unsupervised data class labeling and shape negotiation. This metho...
Andrew Vande Moere, Justin James Clayden, Andy Don...
IPPS
2000
IEEE
13 years 8 months ago
Solving Problems on Parallel Computers by Cellular Programming
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
Domenico Talia
FUIN
2007
114views more  FUIN 2007»
13 years 4 months ago
Cellular Devices and Unary Languages
Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the well-known result that each unary language...
Andreas Klein, Martin Kutrib
GECCO
2005
Springer
171views Optimization» more  GECCO 2005»
13 years 9 months ago
Behaviorally coupled emergent representation
Traditionally, representation has been perceived as a necessity for producing intelligent behavior. Once the right representation is in place to drive it, behavior unfolds as the ...
Joseph Lewis, Jamie Lawson