http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
토러스 네트워크에서 무교착상태의 패킷 라우팅 알고리즘의 성능평가
김현기,박준선,이천희 청주대학교 산업과학연구소 1995 産業科學硏究 Vol.13 No.-
We present a packet routing algorithm that each node have two input and output queues per ego in the torus network, and then implement a simulation environment that contains the presented packet routing algorithm. The explemental result is turned out the fact that node queues provide packet transfers without deadlock And according to the distribution of input packets, the efficient storage can be evaluated from tile result.
FPGA에서 시간구동 최적화의 배치 · 배선에 관한 연구
김현호(Hyeonho Kim),이용희(Yonghui Lee),이천희(Cheonhee Yi) 한국정보과학회 2003 한국정보과학회 학술발표논문집 Vol.30 No.1B
We have developed an optimization algorithm based formulation for performing efficient time driven simultaneous place and route for FPGAs. Field programmable gate array(FPGAs) provide of drastically reducing the turn-around time for digital ICs, with a relatively small degradation in performance. For a variety of application specific integrated circuit application, where time-to-market is most critical and the performance requirement do not mandate a custom or semicustom approach. FPGAs are an increasingly popular alternative. This has prompted a substantial amount of specialized synthesis and layout research focused on maximizing density, minimizing delay, and minimizing design time.
경로문제를 위한 CAD의 heuristic 탐색에 관한 연구
이천희 淸州大學校 1982 論文集 Vol.15 No.2
The original ideas of a simple syntactic model and dictionary look-up were seen to not be able to bear the weight of the problem. It was clear that mathematical linguistics had to be better understood. In heuristic search the same situation exists. The formal tools need to be developed to better understand and increase the power of heuristic programming. The precise characterizing of these ideas allows not only a quantitative improvement from generalizing and extending these methods. The formal model of heuristic search presented here has led to a new understanding of solving problems with occasionally unexpected results.