11 search results - page 1 / 3 » Visualising random boolean network dynamics |
GECCO
2009
Springer
13 years 8 months ago
2009
Springer
We propose a simple approach to visualising the time behaviour of Random Boolean Networks (RBNs), and demonstrate the approach by examining the effect of canalising functions for ...
ECAL
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We propose the use of Deterministic Generalized Asynchronous Random Boolean Networks [1] as models of contextual deterministic discrete dynamical systems. We show that ch...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to neural networks. This paper presents results fr...
ICAI
2003
13 years 6 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
AHS
2006
IEEE
13 years 10 months ago
2006
IEEE
Randomly connecting networks have proven to be universal computing machines. By interconnecting a set of nodes in a random way one can model very complicated non-linear dynamic sy...