Több mint 4 millió cím angol és más nyelveken! Fedezd fel új történetedet még ma!

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: 38334 HUF
Availability: InStock

Szerző: Xinghao Chen, Michael L. Bushnell

Nyelv:

Kötés: Puha kötésű

Kiadó: Springer-Verlag New York Inc.

Elérhetőség: Beszállítói készleten

Küldés 5-8 napon belül

38 334 Ft

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

Információk a könyvről

Szerző

Xinghao Chen, Michael L. Bushnell

Nyelv

Angol

Kötés

Könyv - Puha kötésű

Kiadva

2011

oldal

146

EAN

9781461285717

ISBN

1461285712

Enbook ID

06795738

Kiadó

Springer-Verlag New York Inc.

Súly

261

Méretek

155 x 235 x 10

Teljes leírás

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.

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

Leggyakrabban keresett

Categories

Authors

Publishers

Termékek

Termékek

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

Információk a könyvről

Teljes leírás

Érdekelheti

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták