Sciweavers

2877 search results - page 132 / 576
» The Complexity of Planarity Testing
Sort
View
RECOMB
2009
Springer
16 years 4 months ago
COE: A General Approach for Efficient Genome-Wide Two-Locus Epistasis Test in Disease Association Study
The availability of high density single nucleotide polymorphisms (SNPs) data has made genome-wide association study computationally challenging. Twolocus epistasis (gene-gene inter...
Xiang Zhang, Feng Pan, Yuying Xie, Fei Zou, Wei Wa...
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
16 years 4 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
CEC
2009
IEEE
15 years 11 months ago
Constructing test problems for bilevel evolutionary multi-objective optimization
— Many real-world problems demand a feasible solution to satisfy physical equilibrium, stability, or certain properties which require an additional lower level optimization probl...
Kalyanmoy Deb, Ankur Sinha
ETS
2007
IEEE
94views Hardware» more  ETS 2007»
15 years 10 months ago
An Integrated Built-In Test and Repair Approach for Memories with 2D Redundancy
An efficient on-chip infrastructure for memory test and repair is crucial to enhance yield and availability of SoCs. Therefore embedded memories are commonly equipped with spare r...
Philipp Öhler, Sybille Hellebrand, Hans-Joach...
ASPDAC
2006
ACM
144views Hardware» more  ASPDAC 2006»
15 years 10 months ago
Compaction of pass/fail-based diagnostic test vectors for combinational and sequential circuits
Abstract— Substantial attention is being paid to the fault diagnosis problem in recent test literature. Yet, the compaction of test vectors for fault diagnosis is little explored...
Yoshinobu Higami, Kewal K. Saluja, Hiroshi Takahas...