.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Efficient Branch and Bound Search with Application to Computer-Aided Design
Chen, Xinghao; Bushnell, Michael L.
€ 130.82
FREE Delivery in Ireland
Description for Efficient Branch and Bound Search with Application to Computer-Aided Design
Hardback. This text describes justification equivalence, in which duplication of computations is avoided in the dynamic branch-and-bound search process without using search decision trees. As well as covering the theoretical work, the book deals with applications, particularly ATPG for sequential circuits. Series: Frontiers in Electronic Testing. Num Pages: 160 pages, 1, black & white illustrations. BIC Classification: TBMM; TJFD. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 11. Weight in Grams: 410.
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 ... Read more
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 ... Read more
Product Details
Format
Hardback
Publication date
1995
Publisher
Kluwer Academic Publishers United States
Number of pages
160
Condition
New
Series
Frontiers in Electronic Testing
Number of Pages
146
Place of Publication
Dordrecht, Netherlands
ISBN
9780792396734
SKU
V9780792396734
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Efficient Branch and Bound Search with Application to Computer-Aided Design