| 书目名称 | Efficient Branch and Bound Search with Application to Computer-Aided Design | | 编辑 | Xinghao Chen,Michael L. Bushnell | | 视频video | | | 丛书名称 | Frontiers in Electronic Testing | | 图书封面 |  | | 描述 | Branch-and-bound search has been known for a long time and hasbeen widely used in solving a variety of problems in computer-aideddesign (CAD) and many important optimization problems. .In many applications, the classic branch-and-bound search methodsperform duplications of computations, or rely on the search decisiontrees which keep track of the branch-and-bound search processes. InCAD and many other technical fields, the computational cost ofconstructing branch-and-bound search decision trees in solving largescale problems is prohibitive and duplications of computations areintolerable. Efficient branch-and-bound methods are needed to dealwith today‘s computational challenges. Efficient branch-and-boundmethods must not duplicate computations. ..Efficient Branch and Bound Search with Application toComputer-Aided. .Design. describes an efficient branch-and-boundmethod for logic justification, which is fundamental to .automatictest pattern. .generation. (ATPG), redundancy identification,logic synthesis, minimization, verification, and other problems inCAD. The method is called .justification equivalence., based onthe observation that justification processes may share identicalsubseque | | 出版日期 | Book 1996 | | 关键词 | algorithms; circuit; complexity; computer; computer-aided design (CAD); control; logic; optimization | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4613-1329-8 | | isbn_softcover | 978-1-4612-8571-7 | | isbn_ebook | 978-1-4613-1329-8Series ISSN 0929-1296 | | issn_series | 0929-1296 | | copyright | Kluwer Academic Publishers 1996 |
The information of publication is updating
|
|
发表于 2025-3-21 16:09:05
