Cover Image
Read Now

Efficient Branch and Bound Search with Application to Computer-Aided Design

Branch-and-bound search has been known for a long time and has been widely used in solving a variety of problems in computer-aided design (CAD) and many important optimization problems. In many applications, the classic branch-and-bound search methods perform duplications of computations, or rely on...

Full description

Bibliographic Details
Main Authors: Xinghao Chen, Bushnell, Michael L. (Author)
Format: eBook
Language:English
Published: New York, NY Springer US 1996, 1996
Edition:1st ed. 1996
Series:Frontiers in Electronic Testing
Subjects:
Electrical And Electronic Engineering
Electrical Engineering
Electronic Circuits
Electronic Circuits And Systems
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • I Theory
  • 1 Introduction
  • 2 Justification Equivalence
  • 3 Justification in Finite State Space
  • II Applications
  • 4 Sequential Circuit Test Generation
  • 5 Fault Effects
  • 6 The Sest Algorithm
  • 7 Experimental Results
  • 8 Redundancy Identification
  • 9 Logic Verification
  • 10 Conclusion
  • A Sest User’s Guide
  • A.1 Introduction
  • A.2 Command Synopsis
  • A.3 Options
  • A.4 Inputs and Outputs
  • A.5 Output Files
  • A.6 Example
  • A.7 Down-Loading SEST from the Disk
  • A.8 Reporting Bugs
  • A.9 Author
  • References

Similar Items