Sciweavers

9572 search results - page 3 / 1915
» Cover Algorithms and Their Combination
Sort
View
DATE
2000
IEEE
92views Hardware» more  DATE 2000»
13 years 9 months ago
An Efficient Heuristic Approach to Solve the Unate Covering Problem
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
Roberto Cordone, Fabrizio Ferrandi, Donatella Sciu...
BMCBI
2004
125views more  BMCBI 2004»
13 years 5 months ago
A fast algorithm for determining the best combination of local alignments to a query sequence
Background: Existing sequence alignment algorithms assume that similarities between DNA or amino acid sequences are linearly ordered. That is, stretches of similar nucleotides or ...
Gavin C. Conant, Andreas Wagner
DATE
1999
IEEE
194views Hardware» more  DATE 1999»
13 years 10 months ago
Algorithms for Solving Boolean Satisfiability in Combinational Circuits
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
Luís Guerra e Silva, Luis Miguel Silveira, ...
ANTS
2000
Springer
96views Algorithms» more  ANTS 2000»
13 years 10 months ago
Coverings of Curves of Genus 2
We shall discuss the idea of finding all rational points on a curve C by first finding an associated collection of curves whose rational points cover those of C. This classical ...
E. Victor Flynn
DIS
2003
Springer
13 years 11 months ago
Extraction of Coverings as Monotone DNF Formulas
Abstract. In this paper, we extend monotone monomials as large itemsets in association rule mining to monotone DNF formulas. First, we introduce not only the minimum support but al...
Kouichi Hirata, Ryosuke Nagazumi, Masateru Harao