Efficient Branch and Bound Search with Application to Computer-Aided Design / Najlacnejšie knihy
Efficient Branch and Bound Search with Application to Computer-Aided Design

Kod: 05251369

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

Autor Xinghao Chen, Michael L. Bushnell

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-an ... więcej

121.82


Dostępna u dostawcy w małych ilościach
Wysyłamy za 10 - 15 dni

Potrzebujesz więcej egzemplarzy?Jeżeli jesteś zainteresowany zakupem większej ilości egzemplarzy, skontaktuj się z nami, aby sprawdzić ich dostępność.


Dodaj do schowka

Zobacz książki o podobnej tematyce

Podaruj tę książkę jeszcze dziś
  1. Zamów książkę i wybierz "Wyślij jako prezent".
  2. Natychmiast wyślemy Ci bon podarunkowy, który możesz przekazać adresatowi prezentu.
  3. Książka zostanie wysłana do adresata, a Ty o nic nie musisz się martwić.

Dowiedz się więcej

Więcej informacji o Efficient Branch and Bound Search with Application to Computer-Aided Design

Za ten zakup dostaniesz 304 punkty

Opis

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.

Szczegóły książki

Kategoria Książki po angielsku Technology, engineering, agriculture Technology: general issues Instruments & instrumentation engineering

121.82

Ulubione w innej kategorii



Osobní odběr Bratislava a 2642 dalších

Copyright ©2008-24 najlacnejsie-knihy.sk Wszelkie prawa zastrzeżonePrywatnieCookies


Konto: Logowanie
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Nákupní košík ( prázdný )

Nakupte za 59,99 € a
máte doručení zdarma.

Twoja lokalizacja: