Wonder Club world wonders pyramid logo
×

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

Efficient Branch and Bound Search with Application to Computer-Aided Design
Be the First to Review this Item at Wonderclub
X
Efficient Branch and Bound Search with Application to Computer-Aided Design, 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 synthesi, Efficient Branch and Bound Search with Application to Computer-Aided Design
out of 5 stars based on 0 reviews
5
0 %
4
0 %
3
0 %
2
0 %
1
0 %
Digital Copy
PDF format
1 available   for $179.00
Original Magazine
Physical Format

Sold Out

  • Efficient Branch and Bound Search with Application to Computer-Aided Design
  • Written by author Xinghao Chen
  • Published by Springer-Verlag New York, LLC, 7/31/2012
  • 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 synthesi
Buy Digital  USD$179.00

WonderClub View Cart Button

WonderClub Add to Inventory Button
WonderClub Add to Wishlist Button
WonderClub Add to Collection Button

Book Categories

Authors

Foreword
Preface
1 Introduction 3
2 Justification Equivalence 11
3 Justification In Finite State Space 25
4 Sequential Circuit Test Generation 37
5 Fault Effects 55
6 The SEST Algorithm 59
7 Experimental Results 75
8 Redundancy Identification 97
9 Logic Verification 103
10 Conclusion 109
11 SEST User's Guide 111
References 125
Index 143


Login

  |  

Complaints

  |  

Blog

  |  

Games

  |  

Digital Media

  |  

Souls

  |  

Obituary

  |  

Contact Us

  |  

FAQ

CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!!

X
WonderClub Home

This item is in your Wish List

Efficient Branch and Bound Search with Application to Computer-Aided Design, 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 synthesi, Efficient Branch and Bound Search with Application to Computer-Aided Design

X
WonderClub Home

This item is in your Collection

Efficient Branch and Bound Search with Application to Computer-Aided Design, 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 synthesi, Efficient Branch and Bound Search with Application to Computer-Aided Design

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

X
WonderClub Home

This Item is in Your Inventory

Efficient Branch and Bound Search with Application to Computer-Aided Design, 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 synthesi, Efficient Branch and Bound Search with Application to Computer-Aided Design

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

WonderClub Home

You must be logged in to review the products

E-mail address:

Password: