Sciweavers

10 search results - page 2 / 2
» Intervention in a family of Boolean networks
Sort
View
MST
2006
120views more  MST 2006»
13 years 4 months ago
Exploiting Regularities for Boolean Function Synthesis
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure...
Anna Bernasconi, Valentina Ciriani, Fabrizio Lucci...
BMCBI
2006
119views more  BMCBI 2006»
13 years 4 months ago
A methodology for the structural and functional analysis of signaling and regulatory networks
Background: Structural analysis of cellular interaction networks contributes to a deeper understanding of network-wide interdependencies, causal relationships, and basic functiona...
Steffen Klamt, Julio Saez-Rodriguez, Jonathan A. L...
COMSUR
2011
196views Hardware» more  COMSUR 2011»
12 years 4 months ago
From MANET To IETF ROLL Standardization: A Paradigm Shift in WSN Routing Protocols
—In large networks, a data source may not reach the intended sink in a single hop, thereby requiring the traffic to be routed via multiple hops. An optimized choice of such rout...
Thomas Watteyne, Antonella Molinaro, Maria Grazia ...
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
13 years 9 months ago
The Linear-Array Conjecture in Communication Complexity is False
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
NC
2011
201views Neural Networks» more  NC 2011»
12 years 11 months ago
The computational power of membrane systems under tight uniformity conditions
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
Niall Murphy, Damien Woods