Sciweavers

39 search results - page 3 / 8
» Nullness Analysis in Boolean Form
Sort
View
DATE
2006
IEEE
145views Hardware» more  DATE 2006»
14 years 1 months ago
Building a better Boolean matcher and symmetry detector
Boolean matching is a powerful technique that has been used in technology mapping to overcome the limitations of structural pattern matching. The current basis for performing Bool...
Donald Chai, Andreas Kuehlmann
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
14 years 17 days ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
FLAIRS
2008
13 years 9 months ago
Complementary Analysis of High-Order Association Patterns and Classification
To facilitate more meaningful interpretation considering the internal interdependency relationships between data values, a new form of high-order (multiple-valued) pattern known a...
Thomas W. H. Lui, David K. Y. Chiu
BCBGC
2008
13 years 8 months ago
BMA - Boolean Matrices as Model for Motif Kernels
We introduce the data model BM, which specifies kernels of motifs by means of Boolean matrices. Different from position frequency matrices these only specify which bases can appea...
Jan Schröder, Manfred Schimmler, Heiko Schr&o...
TACAS
2010
Springer
191views Algorithms» more  TACAS 2010»
14 years 2 months ago
Blocked Clause Elimination
Boolean satisfiability (SAT) and its extensions are becoming a core technology for the analysis of systems. The SAT-based approach divides into three steps: encoding, preprocessin...
Matti Järvisalo, Armin Biere, Marijn Heule