Над 4 милиона заглавия на английски и други езици! Открийте новата си история още днес! Безплатна доставка за поръчки над 69.99€

Виж статуса на поръчката

Свържете се с нас

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

Name: Efficient Branch and Bound Search with Application to Computer-Aided Design
Brand: Springer-Verlag New York Inc.
SKU: 9781461285717
Price: 105.19 EUR
Availability: InStock

Автор: Xinghao Chen, Michael L. Bushnell

Език:

Корици: С меки корици

Издател: Springer-Verlag New York Inc.

Наличност: Външен склад

Изпращаме след 5-8 дни

105.19 € 205.74 лв

Branch-and-bound search has been known for a long time and has been widely used in solving a variety...

Информация за книгата

Автор

Xinghao Chen, Michael L. Bushnell

Език

Английски език

Корици

Книга - С меки корици

Издадена

2011

страници

146

EAN

9781461285717

ISBN

1461285712

Enbook ID

06795738

Издател

Springer-Verlag New York Inc.

Теглоt

261

Размери

155 x 235 x 10

Пълно описание

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.

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

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

Информация за книгата

Пълно описание

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също