Sciweavers

1241 search results - page 90 / 249
» Path-oriented random testing
Sort
View
CP
2003
Springer
15 years 11 months ago
Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search
Abstract. In 1997 we presented ten challenges for research on satisfiability testing [1]. In this paper we review recent progress towards each of these challenges, including our o...
Henry A. Kautz, Bart Selman
BMCBI
2010
95views more  BMCBI 2010»
15 years 6 months ago
Modelling p-value distributions to improve theme-driven survival analysis of cancer transcriptome datasets
Background: Theme-driven cancer survival studies address whether the expression signature of genes related to a biological process can predict patient survival time. Although this...
Esteban Czwan, Benedikt Brors, David Kipling
APPROX
2006
Springer
100views Algorithms» more  APPROX 2006»
15 years 10 months ago
Robust Local Testability of Tensor Products of LDPC Codes
Given two binary linear codes R and C, their tensor product R C consists of all matrices with rows in R and columns in C. We analyze the "robustness" of the following te...
Irit Dinur, Madhu Sudan, Avi Wigderson
TR
2008
67views more  TR 2008»
15 years 6 months ago
Degradation Analysis of Nano-Contamination in Plasma Display Panels
Abstract--As an alternative to traditional life testing, degradation tests can be effective in assessing product reliability when measurements of degradation leading to failure can...
Suk Joo Bae, Seong-Joon Kim, Man Soo Kim, Bae Jin ...
ECCC
2011
204views ECommerce» more  ECCC 2011»
14 years 9 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman