Sciweavers

2877 search results - page 181 / 576
» The Complexity of Planarity Testing
Sort
View
DATE
2000
IEEE
130views Hardware» more  DATE 2000»
15 years 9 months ago
Optimal Hardware Pattern Generation for Functional BIST
∗∗ Functional BIST is a promising solution for self-testing complex digital systems at reduced costs in terms of area and performance degradation. The present paper addresses t...
Silvia Cataldo, Silvia Chiusano, Paolo Prinetto, H...
132
Voted
CORR
2010
Springer
108views Education» more  CORR 2010»
14 years 11 months ago
Finding Cycles and Trees in Sublinear Time
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadh...
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
16 years 5 months ago
Fastanova: an efficient algorithm for genome-wide association study
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
Xiang Zhang, Fei Zou, Wei Wang 0010
KBSE
2005
IEEE
15 years 10 months ago
Automated replay and failure detection for web applications
User-session-based testing of web applications gathers user sessions to create and continually update test suites based on real user input in the field. To support this approach ...
Sara Sprenkle, Emily Gibson, Sreedevi Sampath, Lor...
GECCO
2010
Springer
172views Optimization» more  GECCO 2010»
15 years 9 months ago
Designing better fitness functions for automated program repair
Evolutionary methods have been used to repair programs automatically, with promising results. However, the fitness function used to achieve these results was based on a few simpl...
Ethan Fast, Claire Le Goues, Stephanie Forrest, We...