10715 search results - page 385 / 2143 » Proofs from Tests |
171
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
![Resolution Is Not Automatizable Unless W[P] Is Tractable](http://sciweavers.com/files/imagecache/thumbnail/default/content.jpg "Resolution Is Not Automatizable Unless W[P] Is Tractable")
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
202
click to vote
ENTCS
1998
15 years 6 months ago
1998
This paper shows how modal mu-calculus formulae characterizing finite-state processes up to strong or weak bisimulation can be derived directly from the well-known greatest fixp...
140
click to vote
IPL
2010
15 years 5 months ago
2010
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
179
click to vote
ICCAD
1996
IEEE
15 years 11 months ago
1996
IEEE
State justification is a time-consuming operation in test generation for sequential circuits. In this paper, we present a technique to rapidly identify state elements (flip-flops)...
167
click to vote
MICCAI
2002
Springer
16 years 7 months ago
2002
Springer
A large number of test images and their "ground truth" segmentations are needed for performance characterization of the many image segmentation methods. In this work we ...