Efficient Branch and Bound Search with Application to Computer-Aided Design
Language: English
Published by Springer, 1995
- Hardcover
- New

Seller: Biblios, frankfurt am main, hessen, GermanyBiblios
4-star seller
AbeBooks seller since September 10, 2024
Hardcover
Condition: New
US$ 200.75
US$ 10.92 shipping
Ships from Germany to U.S.A.
Quantity: 4 available
Add to basketFree 30-day returns
Item description from seller
PRINT ON DEMAND pp. 164.
Seller Inventory # 183108262
- Title
- Efficient Branch and Bound Search with Application to Computer-Aided Design
- Author
- Bushnell Michael L.
- Publisher
- Springer
- Publication year
- 1995
- Condition
- New
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 0792396731
- ISBN 13
- 9780792396734
- Series
- Book 24 of 40: Frontiers in Electronic Testing
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.
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.
"Synopsis" may belong to another edition of this title.
Biblios
frankfurt am main, hessen, Germany
4-star seller
AbeBooks seller since September 10, 2024
Shipping rates from Germany to U.S.A.
| Item | 25 to 45 business days | 8 to 14 business days |
|---|---|---|
| First item | US$ 10.92 | US$ 20.52 |
Payment methods
Store description
We carry a wide selection of books from South Asia, United States, UK.
Specialty
new books imported from india, uk, usaSeller's business information
Readingos GmbH
Kaiserstraße 47
Frankfurt am Main, Germany 60329
Shipping terms
To ensure faster delivery, books may be shipped from any of the following locations Germany, the United Kingdom (UK), the United States (US), based on the buyer's address and product availability.