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

Lingua: inglese

Editore: Springer US, Humana Sep 2011, 2011

1461285712 / 9781461285717

Serie: Libro 24 di 40 - Frontiers in Electronic Testing

Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000

Venditore con 5 stelle

Venditore AbeBooks dal 23 gennaio 2017

Visualizza gli articoli di questo venditore
Brossura

Condizione: Nuovo

EUR 106,99

EUR 60,00 spedizione 
Spedito da Germania a U.S.A.

Quantità: 1 disponibili

Aggiungi al carrello
Resi gratuiti per 30 giorni

Descrizione dell’articolo da parte del venditore

This item is printed on demand - Print on Demand Titel. 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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 164 pp. Englisch.

Codice articolo 9781461285717

Titolo
Efficient Branch and Bound Search with Application to Computer-Aided Design
Autore
Michael L. Bushnell
Editore
Springer US, Humana Sep 2011
Anno di pubblicazione
2011
Condizione
Neu
Rilegatura
Taschenbuch
Lingua
inglese
ISBN 10
1461285712
ISBN 13
9781461285717
Peso dell'articolo
260 grammi
Dimensioni
235x155x10 mm
Serie
Libro 24 di 40: Frontiers in Electronic Testing

buchversandmimpf2000

Emtmannsberg, BAYE, Germania

Venditore con 5 stelle

Venditore AbeBooks dal 23 gennaio 2017

Tariffe di spedizione da Germania a U.S.A.

ArticoloDa 60 a 60 giorni lavorativiDa 60 a 60 giorni lavorativi
Primo articoloEUR 60,00EUR 75,00
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.

Metodi di pagamento

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay
  • Assegno
  • PayPal

Descrizione dello Store

Impressum Thorsten Retsch Buchversand Mimpf2000 Oberölschnitz 16 95517 Emtmannsberg Deutschland Telefon: 09209-2023188 Email: mimpf2000@online.de USt-ID-Nr.: DE 235096871 Wir führen gebrauchte Bücher aus allen Sparten der Literatur

Specializzazione

Modernes Antiquariat - Bücher von 1960 bis heute

Informazioni sull’azienda del venditore

buchversandmimpf2000

Germania