Sciweavers

CORR
2012
Springer
200views Education» more  CORR 2012»
12 years 6 months ago
Harmonic evolutions on graphs
We define the harmonic evolution of states of a graph by iterative application of the harmonic operator (Laplacian over Z2). This provides graphs with a new geometric context and...
Jerzy Kocik
HISB
2011
92views more  HISB 2011»
12 years 10 months ago
Unsupervised Grow-Cut: Cellular Automata-Based Medical Image Segmentation
— This paper presents a new cellular automata-based unsupervised image segmentation technique that is motivated by the interactive grow-cut algorithm. In contrast to the traditio...
Payel Ghosh, Sameer Antani, L. Rodney Long, George...
IWSOS
2011
Springer
13 years 1 months ago
Evolving Self-organizing Cellular Automata Based on Neural Network Genotypes
Abstract This paper depicts and evaluates an evolutionary design process for generating a complex self-organizing multicellular system based on Cellular Automata (CA). We extend th...
Wilfried Elmenreich, István Fehérv&a...
NABIC
2010
13 years 5 months ago
Evolutionary design of edge detector using rule-changing Cellular automata
A new design method for Cellular automata (CA) rules are described. We have already proposed a method for designing the transition rules of two-dimensional 256-state CA for graysca...
Shohei Sato, Hitoshi Kanoh

0
posts
with
0
views
246profile views
Genaro Juárez MartínezProfessor, Associate
University of the West of England
Genaro Juárez Martínez
Computer Science Laboratory (LCCOMP) http://uncomp.uwe.ac.uk/LCCOMP/
TCS
2011
13 years 5 months ago
On the relationship between fuzzy and Boolean cellular automata
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification" of the local rule of a corresponding Boolean cellula...
Heather Betel, Paola Flocchini
CORR
2011
Springer
144views Education» more  CORR 2011»
13 years 5 months ago
Schema Redescription in Cellular Automata: Revisiting Emergence in Complex Systems
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...
Manuel Marques-Pita, Luis Mateus Rocha
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 5 months ago
Traced communication complexity of cellular automata
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state o...
Eric Goles Ch., Pierre Guillon, Ivan Rapaport
FUIN
2010
158views more  FUIN 2010»
13 years 8 months ago
Cellular Automata, Decidability and Phasespace
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
Klaus Sutner
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 8 months ago
A Categorical Outlook on Cellular Automata
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comona...
Silvio Capobianco, Tarmo Uustalu