rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Efficient Branch and Bound Search with Application to Computer-Aided Design
  name:
    name part: Chen, Xinghao.
    role:
      role term: creator
  name:
    name part: Bushnell, Michael L.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  genre: Electronic books.
  origin info:
    place:
      place term: mau
    date issued: 1996
    issuance: monographic
  language:
    language term: eng
  physical description:
    reformatting quality: access
    form: remote
    extent: 1 online resource (160 pages)
  abstract: 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.
  note: by Xinghao Chen, Michael L. Bushnell.
  note: Electronic resource.
  subject:
    topic: Engineering
  subject:
    topic: Computer engineering
  subject:
    topic: Systems engineering
  subject:
    topic: Computer engineering
  subject:
    topic: Engineering
  subject:
    topic: Systems engineering
  classification: TK7888.4
  classification: 621.3815
  related item:
    title info:
      title: Frontiers in electronic testing ; 4
  identifier: 9781461313298 (electronic bk.)
  identifier: 1461313295 (electronic bk.)
  identifier: 9781461285717
  identifier: 1461285712
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: AU@
    record creation date: 121227
    record change date: 20260422171023.8
    record identifier: in00003570430
    language of cataloging:
      language term: eng