Skip to Main Content
 

Global Search Box

 
 
 
 

ETD Abstract Container

Abstract Header

Neural computing for minimum set covering and gate-packing problems

Chang, Engder

Abstract Details

1993, Doctor of Philosophy, Case Western Reserve University, Electrical Engineering.
This thesis presents a new parallel computing approach for solving two optimization problems including minimum set covering problems and gate-packing problems. The proposed parallel approach uses the artificial neural network model using McCulloch-Pitts neurons and modified maximum neurons. The proposed algorithm of the minimum set covering can be used for solving Boolean minimization problems in VLSI circuits design. The parallel algorithm of the gate-packing problem can be used for designing Weinberger arrays of the VLSI circuits. Both problems belong to NP-complete and the proposed algorithms can deal with the larger size problem in sequential/parallel while the conventional algorithms can solve some limited size problems.
Yoshiyasu Takefuji (Advisor)
80 p.

Recommended Citations

Citations

  • Chang, E. (1993). Neural computing for minimum set covering and gate-packing problems [Doctoral dissertation, Case Western Reserve University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=case1056655652

    APA Style (7th edition)

  • Chang, Engder. Neural computing for minimum set covering and gate-packing problems. 1993. Case Western Reserve University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=case1056655652.

    MLA Style (8th edition)

  • Chang, Engder. "Neural computing for minimum set covering and gate-packing problems." Doctoral dissertation, Case Western Reserve University, 1993. http://rave.ohiolink.edu/etdc/view?acc_num=case1056655652

    Chicago Manual of Style (17th edition)