Andere Kunden interessierten sich auch für
![Efficient Branch and Bound Search with Application to Computer-Aided Design]( "Efficient Branch and Bound Search with Application to Computer-Aided Design")
Efficient Branch and Bound Search with Application to Computer-Aided Design83,99 €![Computer-Aided Design Techniques for Low Power Sequential Logic Circuits]( "Computer-Aided Design Techniques for Low Power Sequential Logic Circuits")
Computer-Aided Design Techniques for Low Power Sequential Logic Circuits125,99 €![Synthesis of Finite State Machines]( "Synthesis of Finite State Machines")
Synthesis of Finite State Machines83,99 €![Sequential Logic Synthesis]( "Sequential Logic Synthesis")
Sequential Logic Synthesis83,99 €![Functional Decomposition with Applications to FPGA Synthesis]( "Functional Decomposition with Applications to FPGA Synthesis")
Functional Decomposition with Applications to FPGA Synthesis125,99 €![High Level Synthesis of ASICs under Timing and Synchronization Constraints]( "High Level Synthesis of ASICs under Timing and Synchronization Constraints")
High Level Synthesis of ASICs under Timing and Synchronization Constraints110,99 €![Computer-Aided Verification]( "Computer-Aided Verification")
Computer-Aided Verification125,99 €
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.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
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.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.