Da: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Paperback. Condizione: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
Da: HPB-Red, Dallas, TX, U.S.A.
paperback. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
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.
Condizione: Used. pp. 236.
EUR 138,15
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Used. pp. 236 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
EUR 139,62
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Used. pp. 236.
EUR 141,75
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
EUR 166,49
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
EUR 140,10
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Advanced BDD Optimization | Rudiger Ebendt (u. a.) | Taschenbuch | x | Englisch | 2010 | Springer | EAN 9781441937964 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Condizione: New. pp. 234.
EUR 167,14
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
EUR 236,32
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 232 pages. 9.45x6.30x0.53 inches. In Stock.
EUR 230,69
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
EUR 262,10
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 126,26
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new. Questo è un articolo print on demand.
Lingua: Inglese
Editore: Springer-Verlag New York Inc., 2010
ISBN 10: 144193796X ISBN 13: 9781441937964
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 168,02
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 160,49
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - 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. 232 pp. Englisch.
Da: moluna, Greven, Germania
EUR 136,16
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.
Da: moluna, Greven, Germania
EUR 137,26
Quantità: Più di 20 disponibili
Aggiungi al carrelloGebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.
Lingua: Inglese
Editore: Springer US, Springer US Okt 2010, 2010
ISBN 10: 144193796X ISBN 13: 9781441937964
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 160,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 232 pp. Englisch.
Da: Majestic Books, Hounslow, Regno Unito
EUR 228,04
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 234 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 228,37
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 234.