Sciweavers

1253 search results - page 242 / 251
» Studying Software Evolution for Taming Software Complexity
Sort
View
FSTTCS
2009
Springer
14 years 3 months ago
Subexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
ISSTA
2004
ACM
14 years 2 months ago
Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach
Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing i...
André Baresel, David Binkley, Mark Harman, ...
ERSHOV
2009
Springer
14 years 14 days ago
Anti-unification Algorithms and Their Applications in Program Analysis
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Z...
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 8 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
BMCBI
2005
112views more  BMCBI 2005»
13 years 8 months ago
Vector analysis as a fast and easy method to compare gene expression responses between different experimental backgrounds
Background: Gene expression studies increasingly compare expression responses between different experimental backgrounds (genetic, physiological, or phylogenetic). By focusing on ...
Rainer Breitling, Patrick Armengaud, Anna Amtmann