Sciweavers

738 search results - page 4 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
MOC
2000
71views more  MOC 2000»
14 years 9 months ago
Zeroes of Dirichlet L-functions and irregularities in the distribution of primes
Seven widely spaced regions of integers with 4,3(x) < 4,1(x) have been discovered using conventional prime sieves. Assuming the generalized Riemann hypothesis, we modify a resul...
Carter Bays, Richard H. Hudson
IJCAI
2001
14 years 11 months ago
Efficient Consequence Finding
We present an extensive experimental study of consequence-finding algorithms based on kernel resolution, using both a trie-based and a novel ZBDD-based implementation, which uses ...
Laurent Simon, Alvaro del Val
98
Voted
BMCBI
2006
139views more  BMCBI 2006»
14 years 9 months ago
Improvement in accuracy of multiple sequence alignment using novel group-to-group sequence alignment algorithm with piecewise li
Background: Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy...
Shinsuke Yamada, Osamu Gotoh, Hayato Yamana
FSTTCS
2001
Springer
15 years 2 months ago
Computability and Complexity Results for a Spatial Assertion Language for Data Structures
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
Cristiano Calcagno, Hongseok Yang, Peter W. O'Hear...
MOC
1998
85views more  MOC 1998»
14 years 9 months ago
Remarks on the Schoof-Elkies-Atkin algorithm
Abstract. Schoof’s algorithm computes the number m of points on an elliptic curve E defined over a finite field Fq. Schoof determines m modulo small primes using the character...
L. Dewaghe