0
Your cart

Your cart is empty

Books > Professional & Technical > Technology: general issues > Instruments & instrumentation engineering > Engineering measurement & calibration

Buy Now

Efficient Branch and Bound Search with Application to Computer-Aided Design (Hardcover, 1996 ed.) Loot Price: R2,952
Discovery Miles 29 520
Efficient Branch and Bound Search with Application to Computer-Aided Design (Hardcover, 1996 ed.): Xinghao Chen, Michael L....

Efficient Branch and Bound Search with Application to Computer-Aided Design (Hardcover, 1996 ed.)

Xinghao Chen, Michael L. Bushnell

Series: Frontiers in Electronic Testing, 4

 (sign in to rate)
Loot Price R2,952 Discovery Miles 29 520 | Repayment Terms: R277 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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 the search decision trees which keep track of the branch-and-bound search processes. In CAD and many other technical fields, the computational cost of constructing branch-and-bound search decision trees in solving large scale problems is prohibitive and duplications of computations are intolerable. Efficient branch-and-bound methods are needed to deal with today's computational challenges. Efficient branch-and-bound methods must not duplicate computations. Efficient Branch and Bound Search with Application to Computer-Aided Design describes an efficient branch-and-bound method for logic justification, which is fundamental to automatic test pattern generation (ATPG), redundancy identification, logic synthesis, minimization, verification, and other problems in CAD. The method is called justification equivalence, based on the observation that justification processes may share identical subsequent search decision sequences. With justification equivalence, duplication of computations is avoided in the dynamic branch-and-bound search process without using search decision trees. Efficient Branch and Bound Search with Application to Computer-Aided Design consists of two parts. The first part, containing the first three chapters, provides the theoretical work. The second part deals with applications, particularly ATPG for sequential circuits. This book is particularly useful to readers who are interested in the design and test of digital circuits.

General

Imprint: Springer
Country of origin: Netherlands
Series: Frontiers in Electronic Testing, 4
Release date: 2001
First published: 1996
Authors: Xinghao Chen • Michael L. Bushnell
Dimensions: 234 x 156 x 11mm (L x W x T)
Format: Hardcover
Pages: 146
Edition: 1996 ed.
ISBN-13: 978-0-7923-9673-4
Categories: Books > Professional & Technical > Technology: general issues > Instruments & instrumentation engineering > Engineering measurement & calibration
Books > Professional & Technical > Electronics & communications engineering > Electronics engineering > Electronic devices & materials > General
Promotions
LSN: 0-7923-9673-1
Barcode: 9780792396734

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners