English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 15193731      Online Users : 85
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 歷任校長 > 李家同 (1993-1994) > 期刊論文  >  An Algorithm to Generate Prime Implicants and Its Applications to the Selection Problem

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80757

    Title: An Algorithm to Generate Prime Implicants and Its Applications to the Selection Problem
    Authors: Lee, R. C. T.
    教師: 李家同
    Date: 1972
    Publisher: Elsevier
    Relation: Information Sciences, Elsevier, Volume 4, 1972, Pages 251-259
    Keywords: Algorithm
    Selection Problem
    Abstract: In this paper, the algorithm to generate prime implicants presented in Ref. 5 is extended to a new algorithm. The new algorithm does not require the Boolean function to be in conjunctive normal form and is complete in the sense that it generates all the prime implicants. The author also shows that this new algorithm can be used to efficiently solve the selection problem . By using this algorithm, the original selection problem can be solved by a branch-and-bound approach which avoids an exhaustive search of the solution space and reduces the amount of necessary calculations.
    Relation Link: http://www.elsevier.com/wps/find/homepage.cws_home
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80757
    Appears in Collections:[李家同 (1993-1994)] 期刊論文
    [資訊工程學系] 期刊論文

    Files in This Item:

    File SizeFormat


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback