Sciweavers

63 search results - page 10 / 13
» A Probabilistic Parser Applied to Software Testing Documents
Sort
View
TCBB
2010
98views more  TCBB 2010»
13 years 1 months ago
VARUN: Discovering Extensible Motifs under Saturation Constraints
Abstract-The discovery of motifs in biosequences is frequently torn between the rigidity of the model on the one hand and the abundance of candidates on the other. In particular, m...
Alberto Apostolico, Matteo Comin, Laxmi Parida
WSC
2004
13 years 8 months ago
Visual Modeling of Business Problems: Workflow and Patterns
Computer-based business analysis relies on models, or algorithmic representations of the business process. Real-life business problems can become very complex, which creates diffi...
Lev Virine, Jason McVean
MSR
2006
ACM
14 years 1 months ago
Using evolutionary annotations from change logs to enhance program comprehension
Evolutionary annotations are descriptions of how source code evolves over time. Typical source comments, given their static nature, are usually inadequate for describing how a pro...
Daniel M. Germán, Peter C. Rigby, Margaret-...
ISSTA
2009
ACM
14 years 1 months ago
HAMPI: a solver for string constraints
Many automatic testing, analysis, and verification techniques for programs can be effectively reduced to a constraint-generation phase followed by a constraint-solving phase. Th...
Adam Kiezun, Vijay Ganesh, Philip J. Guo, Pieter H...
SIGIR
2005
ACM
14 years 19 days ago
Relevance weighting for query independent evidence
A query independent feature, relating perhaps to document content, linkage or usage, can be transformed into a static, per-document relevance weight for use in ranking. The challe...
Nick Craswell, Stephen E. Robertson, Hugo Zaragoza...