738 search results - page 5 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
AUSAI
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This note describes a method for computation of non-redundant bases of attribute implications from data tables with fuzzy attributes. Attribute implications are formulas ...
104
click to vote
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
79
Voted
CC
2010
Springer
14 years 7 months ago
2010
Springer
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
78
Voted
PC
1998
14 years 9 months ago
1998
Linear congruential generators (LCGs) remain the most popular method of pseudorandom number generation on digital computers. Ease of implementation has favored implementing LCGs wi...
FUIN
2007
14 years 9 months ago
2007
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...