Two approaches for control store width minimization제어 메모리의 너비 최소화를 위한 두 가지 제안

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 333
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorLee, Hwang-Soo-
dc.contributor.advisor이황수-
dc.contributor.authorHong, Se-Kyoung-
dc.contributor.author홍세경-
dc.date.accessioned2011-12-14T02:14:56Z-
dc.date.available2011-12-14T02:14:56Z-
dc.date.issued1990-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=67394&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/39183-
dc.description학위논문(석사) - 한국과학기술원 : 전기 및 전자공학과, 1990.2, [ [ii], 35 p. ]-
dc.description.abstractThis paper presents two new approaches for control memory width minimization problem. One uses integer linear programming, and the other is based on heuristic partitioning. The integer linear programming method guarantees optimal solutions of reasonable size problem within small amount of time. The heuristic partition approach obtains near optimal solutions for the problems of any size with the time complexity of O(n$^3$ logn).eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.titleTwo approaches for control store width minimization-
dc.title.alternative제어 메모리의 너비 최소화를 위한 두 가지 제안-
dc.typeThesis(Master)-
dc.identifier.CNRN67394/325007-
dc.description.department한국과학기술원 : 전기 및 전자공학과, -
dc.identifier.uid000881537-
dc.contributor.localauthorLee, Hwang-Soo-
dc.contributor.localauthor이황수-
Appears in Collection
EE-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0