Results 261 to 270 of about 713,380 (292)

Bounds on pseudoexhaustive test lengths

IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1998
Pseudoexhaustive testing involves applying all possible input patterns to the individual output cones of a combinational circuit. Based on our new algebraic results, we have derived both generic (cone-independent) and circuit-specific (cone-dependent) bounds on the minimal length of a test required so that each cone in a circuit is exhaustively tested.
R. Srinivasan, S.K. Gupta, M.A. Breuer
openaire   +1 more source

Finite-Frequency Identification: Test Frequency Bounds

Automation and Remote Control, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Probability lower bounds for USP/NF tests

Journal of Biopharmaceutical Statistics, 2002
In the pharmaceutical industry, a number of tests such as content uniformity and dissolution testing are usually performed at various stages of drug manufacturing process to ensure that the drug product meets standards for identity, strength, quality, purity, and stability of the drug product as specified in the United States Pharmacopedia and National
Shein-Chung, Chow, Jun, Shao, Hansheng, Wang   +2 more
openaire   +2 more sources

Testing Exact Upper Bounds to Exact Exchange

Journal of Chemical Theory and Computation, 2017
The exact exchange energy and its energy density are useful but computationally expensive ingredients in density functional approximations for Kohn-Sham density functional theory. We present detailed tests of some exact nonempirical upper bounds to exact exchange.
Emil Proynov, Benjamin G. Janesko
openaire   +2 more sources

Exact Confidence Bounds Following Adaptive Group Sequential Tests

Biometrics, 2009
Summary We provide a method for obtaining confidence intervals, point estimates, and p‐values for the primary effect size parameter at the end of a two‐arm group sequential clinical trial in which adaptive changes have been implemented along the way. The method is based on applying the adaptive hypothesis testing procedure of Müller and Schäfer (2001 ...
Brannath, Werner, Mehta, Cyrus R., Posch, Martin   +2 more
openaire   +3 more sources

Self-test scheduling with bounded test execution time

Proceedings International Test Conference 1992, 1992
Complex VLSI circuits with built-in self-test resources are segmented into a number of subcircuits, that to some extent can be tested concurrently. For each subcircuit a signature is collected. The test schedule has to organize the test execution such that the available resources are optimally utilized.
openaire   +1 more source

Dynamic rate bound acceptance test approaches

1999 European Control Conference (ECC), 1999
In this paper, an effective dynamic rate bound acceptance test approach is developed. The acceptance test performs a reasonableness check on the controller outputs, based upon critical control theory which leads to least upper bounds of the controller output.
R. Stroph, T. Clarke
openaire   +1 more source

A lower bound for testing juntas

Information Processing Letters, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chockler, Hana, Gutfreund, Dan
openaire   +1 more source

Complexity Bounded Martin-Löf Tests

1987
One of the main ways of attacking the famous P = ?NP problem and its associates consists in the consideration of some classical tools from the recursive function theory (different kind of reducibilities, relativization, immunity, a.s.o.) in complexity bounded forms.
openaire   +1 more source

TESTING COVARIANT ENTROPY BOUNDS

New Worlds in Astroparticle Physics, 2006
SIJIE GAO, JOSÉ P. S. LEMOS
openaire   +1 more source