Sciweavers

707 search results - page 47 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
BMCBI
2007
140views more  BMCBI 2007»
13 years 8 months ago
Investigations into the relationship between feedback loops and functional importance of a signal transduction network based on
Background: A number of studies on biological networks have been carried out to unravel the topological characteristics that can explain the functional importance of network nodes...
Yung-Keun Kwon, Sun Shim Choi, Kwang-Hyun Cho
CCCG
2010
13 years 9 months ago
Any monotone boolean function can be realized by interlocked polygons
We show how to construct interlocked collections of simple polygons in the plane that fall apart upon removing certain combinations of pieces. Precisely, interiordisjoint simple p...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
AAAI
1998
13 years 9 months ago
Learning Evaluation Functions for Global Optimization and Boolean Satisfiability
This paper describes STAGE, a learning approach to automatically improving search performance on optimization problems.STAGElearns an evaluation function which predicts the outcom...
Justin A. Boyan, Andrew W. Moore
GLVLSI
1996
IEEE
145views VLSI» more  GLVLSI 1996»
14 years 4 days ago
Boolean Function Representation Using Parallel-Access Diagrams
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
Valeria Bertacco, Maurizio Damiani
DFG
1992
Springer
14 years 1 days ago
Complexity of Boolean Functions on PRAMs - Lower Bound Techniques
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
Miroslaw Kutylowski