1422 search results - page 239 / 285 » Test Generation Algorithms Based on Preorder Relations |
CC
2007
Springer
14 years 9 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
100
click to vote
DAC
2005
ACM
14 years 11 months ago
2005
ACM
Reliability of nanometer circuits is becoming a major concern in today’s VLSI chip design due to interferences from multiple noise sources as well as radiation-induced soft erro...
107
click to vote
EJWCN
2011
14 years 4 months ago
2011
—This paper presents CARNIVORE, a system for in-situ, yet unobtrusive monitoring of cryptic, difficult-tocatch/observe wildlife in their natural habitat. CARNIVORE consists of a...
ENVSOFT
2008
14 years 9 months ago
2008
Many impact studies require climate change information at a finer resolution than that provided by Global Climate Models (GCMs). In the last 10 years, downscaling techniques, both...
COGSCI
2002
14 years 9 months ago
2002
We address how listeners perceive temporal regularity in music performances, which are rich in temporal irregularities. A computational model is described in which a small system ...