267 search results - page 1 / 54 » Generating all maximal models of a Boolean expression |
102
Voted
IPL
2000
15 years 27 days ago
2000
We examine the computational problem of generating all maximal models of a Boolean expression in CNF. We give a resolution-like method that reduces the unnegated variables of an e...
108
Voted
IJKDB
2010
14 years 10 months ago
2010
Regulatory network analysis and other bioinformatics tasks require the ability to induce and represent arbitrary boolean expressions from data sources. We introduce a novel framew...
108
Voted
KDD
2006
ACM
16 years 1 months ago
2006
ACM
We introduce a novel framework (BLOSOM) for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: p...
83
Voted
ICCAD
2005
IEEE
15 years 10 months ago
2005
IEEE
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
102
Voted
ECRTS
2000
IEEE
15 years 5 months ago
2000
IEEE
The imprecise computation(IC) model is a general scheduling framework, capable of expressing the precision vs. timeliness trade-off involved in many current real-time applications...