Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Fundamenta Informaticae

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

A Neuro-Genetic Framework for Pattern Recognition in Complex Systems

Bandini S., Vanneschi L., Wuensche A., Bahgat Shehata A.

Fundamenta Informaticae

2008

Vol. 87, nr 2

207-226

This paper presents a general framework to automatically generate rules that produce given spatial patterns in complex systems. The proposed framework integrates Genetic Algorithms with Artificial Neural Networks or Support Vector Machines. Here, it is tested on a well known 3-values, 6-neighbors, k-totalistic cellular automata rule called the "burning paper" rule. Results are encouraging and should pave the way for the use of the proposed framework in real-life complex systems models.

Supporting Action-at-a-distance in Situated Cellular Agents

Bandini S., Mauri G., Vizzari G.

Fundamenta Informaticae

2006

Vol. 69, nr 3

251-271

The aim of this paper is to describe algorithms and structures required to support action-at-a-distance in Situated Cellular Agents (SCA). This model provides the possibility to define heterogeneous entities placed in regular or irregular spatial infrastructures. Different mechanisms supporting field diffusion within these structures will be described and analyzed, with reference to their performance. A sample application of SCA model (a variation of Conway's Game of Life) will also be illustrated, while a more complex usage of action-at-a-distance for pedestrian simulation will be sketched.

Integrating Forms of Interaction in a Distributed Model

Bandini S., Simone C.

Fundamenta Informaticae

2004

Vol. 61, nr 1

1--17

The main aim of this paper is to present the formal description of the Multilayered Reaction-Diffusion Machine (MRDM, an extension of a previously introduced RDM, Reaction-Diffusion Machine) which can be seen as a generalization of Cellular Automata since it relaxes some constraints on uniformity, locality and closure. The MRDM offers a formal and computational environment where to describe, represent and simulate coordination models which explicitly require spatial features to be considered and integrates different forms of interaction. The paper is divided into two main parts. In the first one, the formal description of the MRDM is presented. In the second part the MRDM is put in relation with deterministic Turing machines; moreover we show how the MRDM, under determined constraints, collapses on a traditional CA.