Sciweavers

1404 search results - page 85 / 281
» Complexity of admissible rules
Sort
View
TCS
2011
13 years 4 months ago
Communication complexity and intrinsic universality in cellular automata
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rap...
ICDM
2007
IEEE
197views Data Mining» more  ICDM 2007»
14 years 3 months ago
Trend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks
Complex networks have been used successfully in scientific disciplines ranging from sociology to microbiology to describe systems of interacting units. Until recently, studies of...
Ruoming Jin, Scott McCallen, Eivind Almaas
ICS
2010
Tsinghua U.
14 years 6 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
ALIFE
2006
13 years 9 months ago
Picture This: The State of the Art in Visualization for Complex Adaptive Systems
Visualization has an increasingly important role to play in scientific research. Moreover, visualization has a special role to play within artificial life as a result of the inform...
Seth Bullock, Tom Smith, Jon Bird
LPAR
2004
Springer
14 years 2 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel