Sciweavers

35 search results - page 2 / 7
» Size-Time Complexity of Boolean Networks for Prefix Computat...
Sort
View
CMSB
2010
Springer
13 years 2 months ago
Stochasticity in reactions: a probabilistic Boolean modeling approach
Boolean modeling frameworks have long since proved their worth for capturing and analyzing essential characteristics of complex systems. Hybrid approaches aim at exploiting the ad...
Sven Twardziok, Heike Siebert, Alexander Heyl
MST
2006
99views more  MST 2006»
13 years 7 months ago
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
Tobias Riege, Jörg Rothe
AB
2008
Springer
14 years 2 months ago
Algorithms for Inference, Analysis and Control of Boolean Networks
Boolean networks (BNs) are known as a mathematical model of genetic networks. In this paper, we overview algorithmic aspects of inference, analysis and control of BNs while focusin...
Tatsuya Akutsu, Morihiro Hayashida, Takeyuki Tamur...
CIBCB
2005
IEEE
14 years 1 months ago
Network Motifs, Feedback Loops and the Dynamics of Genetic Regulatory Networks
We analyse a suite of Boolean networks which have been evolved to exhibit limit cycle-type dynamics in terms of the distribution of small network motifs and feedback loops. We find...
Jennifer Hallinan, Paul T. Jackway
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 11 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass