๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Forecasting the efficiency of test generation algorithms for combinational circuits

โœ Scribed by Shiyi Xu; Tukwasibwe Justaf Frank

Publisher
Springer
Year
2000
Tongue
English
Weight
918 KB
Volume
15
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm to generate complete test s
An algorithm to generate complete test sets for stuck-at faults in combinational logic circuits
โœ Leonard J. Tung; David V. Kerns ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 581 KB

A new algorithm to generate test sets for stuck-at faults in combinational logic circuits via fault simulation is presented. The algorithm is non-path-sensitizing, non-pathtracing and can be easily implemented on a computer. The stuck-at fault model in the algorithm is developed using the component

The use of encompassing tests for foreca
The use of encompassing tests for forecast combinations
โœ Turgut KฤฑลŸฤฑnbay ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 140 KB

## Abstract This paper proposes an algorithm that uses forecast encompassing tests for combining forecasts when there are a large number of forecasts that might enter the combination. The algorithm excludes a forecast from the combination if it is encompassed by another forecast. To assess the usef

The usefulness of heuristic N(E)RLS algo
The usefulness of heuristic N(E)RLS algorithms for combining forecasts
โœ Sevket I. Gunter; Celal Aksu ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 243 KB

There exists theoretical and empirical evidence on the efficiency and robustness of Non-negativity Restricted Least Squares combinations of forecasts. However, the computational complexity of the method hinders its widespread use in practice. We examine various optimizing and heuristic computational