Sciweavers

133 search results - page 13 / 27
» Re-seeding invalidates tests of random number generators
Sort
View
AAAI
2000
14 years 11 months ago
Redundancy in Random SAT Formulas
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
Yacine Boufkhad, Olivier Roussel
TAP
2010
Springer
134views Hardware» more  TAP 2010»
14 years 7 months ago
Testing First-Order Logic Axioms in Program Verification
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
Ki Yung Ahn, Ewen Denney
63
Voted
ISCAS
2003
IEEE
102views Hardware» more  ISCAS 2003»
15 years 2 months ago
A deterministic dynamic element matching approach to ADC testing
A deterministic dynamic element matching (DEM) approach to ADC testing is introduced and compared with a common random DEM method. With both approaches, a highly non-ideal DAC is ...
Beatriz Olleta, Lance Juffer, Degang Chen, Randall...
BMCBI
2006
200views more  BMCBI 2006»
14 years 9 months ago
Comparison and evaluation of methods for generating differentially expressed gene lists from microarray data
Background: Numerous feature selection methods have been applied to the identification of differentially expressed genes in microarray data. These include simple fold change, clas...
Ian B. Jeffery, Desmond G. Higgins, Aedín C...
76
Voted
AAAI
1997
14 years 11 months ago
Variable-Selection Heuristics in Local Search for SAT
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a...
Alex S. Fukunaga