|
Title:
|
A COMPUTATION SCHEME BASED ON RANDOM BOOLEAN NETWORKS ON THE CRITICAL LINE |
|
Author(s):
|
Elena Dubrova , Hannu Tenhunen |
|
ISBN:
|
972-8924-09-7 |
|
Editors:
|
Nuno Guimarães, Pedro Isaías and Ambrosio Goikoetxea |
|
Year:
|
2006 |
|
Edition:
|
Single |
|
Keywords:
|
Random Boolean network, attractor, Boolean function, fault-tolerance. |
|
Type:
|
Full Paper |
|
First Page:
|
273 |
|
Last Page:
|
280 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
As silicon transistor technology approaches nano-meter dimensions and its speed and integration slow down, the need for alternative computation schemes becomes evident. This paper proposes a computation scheme based on random boolean networks (RBNs). RBNs are used in a number of applications in biology and physics, including cell differentiation, immune response, evolution, gene regulatory networks and neural networks. Our interest in RBNs is due to their attractive fault-tolerant features. The parameters of an RBN can be tuned so that the network exhibits self-organized critical behavior ensuring both stability and evolutionary improvements. On one hand, different kind of faults, e.g. a change in the state of a particular vertex, or connection, typically cause no variations in network's dynamics. On the other hand, if a sufficient number of mutations is allowed, a network can adopt to the changing environment by re-configuring its structure. |
|
|
|
|
|
|
