Sciweavers

133 search results - page 27 / 27
» Memory with memory: soft assignment in genetic programming
Sort
View
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
13 years 10 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
ASAP
2003
IEEE
133views Hardware» more  ASAP 2003»
13 years 10 months ago
Storage Management in Process Networks using the Lexicographically Maximal Preimage
At the Leiden Embedded Research Center, we are developing a compiler called Compaan that automatically translates signal processing applications written in Matlab into Kahn Proces...
Alexandru Turjan, Bart Kienhuis
ISSTA
2000
ACM
13 years 9 months ago
Which pointer analysis should I use?
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
Michael Hind, Anthony Pioli