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

Language: English

Published by Springer US Dez 1995, 1995

0792396731 / 9780792396734

Series: Book 24 of 40 - Frontiers in Electronic Testing

  • Hardcover
  • New
See all details

Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.

5-star seller

AbeBooks seller since January 11, 2012

View this seller's items
Hardcover

Condition: New

£ 94.44

£ 19.71 shipping 
Ships from Germany to U.S.A.

Quantity: 2 available

Add to basket
Free 30-day returns

Item description from seller

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 164 pp. Englisch.

Seller Inventory # 9780792396734

Title
Efficient Branch and Bound Search with Application to Computer-Aided Design
Author
Michael L. Bushnell
Publisher
Springer US Dez 1995
Publication year
1995
Condition
Neu
Binding
Buch
Language
English
ISBN 10
0792396731
ISBN 13
9780792396734
Item weight
418 grams
Dimensions
241x160x15 mm
Series
Book 24 of 40: Frontiers in Electronic Testing

BuchWeltWeit Ludwig Meier e.K.

Bergisch Gladbach, Germany

5-star seller

AbeBooks seller since January 11, 2012

Shipping rates from Germany to U.S.A.

Item5 to 15 business days5 to 15 business days
First item£ 19.71£ 19.71
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay
  • Bank Wire Transfer
  • Check
  • Paypal

Seller's business information

BuchWeltWeit Ludwig Meier e.K.

Germany