Sciweavers

706 search results - page 25 / 142
» On a quasi-ordering on Boolean functions
Sort
View
BMCBI
2007
140views more  BMCBI 2007»
13 years 7 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
GLVLSI
2007
IEEE
167views VLSI» more  GLVLSI 2007»
14 years 2 months ago
A new approach to logic synthesis of multi-output boolean functions on pal-based CPLDS
A PAL-based logic block is the core of great majority of contemporary CPLD devices. The purpose of the paper is to present a new approach to multi-level synthesis for PAL-based CP...
Dariusz Kania
IPPS
2006
IEEE
14 years 1 months ago
Placement and routing of Boolean functions in constrained FPGAs using a distributed genetic algorithm and local search
In this work we present a system for implementing the placement and routing stages in the FPGA cycle of design, into the physical design stage. We start with the ISCAS benchmarks,...
Manuel Rubio del Solar, Juan Manuel Sánchez...
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
DAC
2008
ACM
14 years 8 months ago
Bi-decomposing large Boolean functions via interpolation and satisfiability solving
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
Ruei-Rung Lee, Jie-Hong Roland Jiang, Wei-Lun Hung