Condizione: New. pp. 236.
EUR 80,44
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 236 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
EUR 83,04
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 236.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
EUR 124,25
Quantità: 1 disponibili
Aggiungi al carrelloBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
EUR 156,12
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
EUR 158,81
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
EUR 178,14
Quantità: Più di 20 disponibili
Aggiungi al carrelloGebunden. Condizione: New. BDD and SAT are major concepts in VLSI CADNew objective functions for design space exploration require new algorithms for BDD optimizationLatest trend: fusion of the concepts BDD and SATMajor impulses come from Artificial Intelligenc.
EUR 225,86
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
EUR 247,94
Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Neuware - VLSI CADhas greatly bene ted from the use of reduced ordered Binary Decision Diagrams (BDDs) and the clausal representation as a problem of Boolean Satis ability (SAT), e.g. in logic synthesis, ver- cation or design-for-testability. In recent practical applications, BDDs are optimized with respect to new objective functions for design space exploration. The latest trends show a growing number of proposals to fuse the concepts of BDD and SAT. This book gives a modern presentation of the established as well as of recent concepts. Latest results in BDD optimization are given, c- ering di erent aspects of paths in BDDs and the use of e cient lower bounds during optimization. The presented algorithms include Branch and Bound and the generic A -algorithm as e cient techniques to - plore large search spaces. The A -algorithm originates from Arti cial Intelligence (AI), and the EDA community has been unaware of this concept for a long time. Re- cently, the A -algorithm has been introduced as a new paradigm to explore design spaces in VLSI CAD. Besides AI search techniques, the book also discusses the relation to another eld of activity bordered to VLSI CAD and BDD optimization: the clausal representation as a SAT problem.