Sciweavers

507 search results - page 66 / 102
» A tabu search algorithm for structural software testing
Sort
View
IUI
2011
ACM
12 years 10 months ago
Predicting and compensating for lexicon access errors
Learning a foreign language is a long, error-prone process, and much of a learner’s time is effectively spent studying vocabulary. Many errors occur because words are only partl...
Lars Yencken, Timothy Baldwin
BMCBI
2005
152views more  BMCBI 2005»
13 years 7 months ago
Improved profile HMM performance by assessment of critical algorithmic features in SAM and HMMER
Background: Profile hidden Markov model (HMM) techniques are among the most powerful methods for protein homology detection. Yet, the critical features for successful modelling ar...
Markus Wistrand, Erik L. L. Sonnhammer
BMCBI
2005
132views more  BMCBI 2005»
13 years 7 months ago
Kalign - an accurate and fast multiple sequence alignment algorithm
Background: The alignment of multiple protein sequences is a fundamental step in the analysis of biological data. It has traditionally been applied to analyzing protein families f...
Timo Lassmann, Erik L. L. Sonnhammer
ASPLOS
2011
ACM
12 years 11 months ago
ConSeq: detecting concurrency bugs through sequential errors
Concurrency bugs are caused by non-deterministic interleavings between shared memory accesses. Their effects propagate through data and control dependences until they cause softwa...
Wei Zhang, Junghee Lim, Ramya Olichandran, Joel Sc...
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
13 years 11 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge