738 search results - page 6 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
173
click to vote
DSD
2003
IEEE
15 years 12 months ago
2003
IEEE
We present a novel heuristic algorithm for two-level Boolean minimization. In contrast to the other approaches, the proposed method firstly finds the coverage of the on-sets and f...
144
click to vote
FLAIRS
2001
15 years 8 months ago
2001
A maximal prime subgraph decomposition junction tree (MPD-JT) is a useful computational structure that facilitates lazy propagation in Bayesian networks (BNs). A graphical method ...
180
click to vote
CADE
2002
Springer
16 years 7 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
187
Voted
CCGRID
2002
IEEE
15 years 11 months ago
2002
IEEE
Resource management is a central part of a Grid computing system. In a large-scale wide-area system such as the Grid, security is a prime concern. One approach is to be conservati...
189
click to vote
DISOPT
2008
15 years 6 months ago
2008
The paper is concerned with the computational evaluation and comparison of a new family of conflict-based branching heuristics for evolved DPLL Satisfiability solvers. Such a fami...