Browse by Title
Showing results 49021 to 49040 of 276379
| Computer-supported project coordination in virtual work environment = 가상 작업 환경에서의 협력적인 프로젝트 관리에 관한 연구link Kim, Chae-Hee; 김채희; et al, 한국과학기술원, 1997 |
| Computerization of Performance Test Procedures in Gori NPP Unit 3&4 Heo, GY; Lee, SJ; Lee, DG; Lee, JW; Park, JC; Chang, Soon-Heung, 한국원자력학회 추계학술발표대회, 한국원자력학회, 2003 |
| Computerized girth determination for custom footwear manufacture Zhao, J.; Xiong, Shuping; Bu, Y.; Goonetilleke, R. S., COMPUTERS & INDUSTRIAL ENGINEERING, v.54, no.3, pp.359 - 373, 2008-04 |
| Computers for molecules and materials: Theory, algorithms, and applications Jung, Yousung, Academia Sinica, Academia Sinica, 2012-04-18 |
| Computers in Chemistry for Energy Storage and Conversion 정유성, 전기화학회 전기물리화학분과 하게 심포지움, 한국전기화학회, 2014-07-21 |
| Computersin Materials Science for EEWS Applications Jung, Yousung, 2013년도 대한금속재료학회 추계학술대회, 대한금속재료학회, 2013-10-24 |
| Computerunterstuetzter Unterricht in Korea-Selbestlernen mit dem Computer Hong, Myung-Soon, IDV-Regional Tagung Asien in Beijing, 1994 |
| Computing a minimum-dilation spanning tree is NP-hard Cheong, Otfried; Haverkort, Herman; Lee, Mira, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.41, no.3, pp.188 - 205, 2008-11 |
| Computing a minimum-dilation spanning tree is NP-hard Cheong, Otfried; Haverkort, Herman; Lee, Mira, Computing: The Australasian Theory Symposium (CATS) 2007, pp.15 - 24, CATS '07, 2007-01-30 |
| Computing a minimum-dilation spanning tree is NP-hard = 최소-Dilation 신장 트리 찾기의 NP-hard 증명link Lee, Mi-Ra; 이미라; Cheong, Otfried; et al, 한국과학기술원, 2007 |
| Computing a single cell in the overlay of two simple polygons deBerg, M; Devillers, O; Dobrindt, K; Cheong, Otfried, INFORMATION PROCESSING LETTERS, v.63, no.4, pp.215 - 219, 1997-08 |
| Computing adsorption properties of structurally deformed metal organic frameworks using a feature space map Jeong, Wooseok; Kim, Jihan; Lim, Dae-Woon; Kim, Sungjune; Harale, Aadesh; Yoon, Minyoung; Paik, Myunghyun, 253rd ACS National Meeting & Exposition, American Chemical Society (ACS), 2017-04-06 |
| Computing and combinatorics - Preface Chwa, Kyung Yong; Munro, J. Ian, THEORETICAL COMPUTER SCIENCE, v.363, no.1, pp.1 - 1, 2006-10 |
| Computing and verifying depth orders Berg, Mark de; Overmars, Mark; Cheong, Otfried, 8th Annual ACM Symposium on Computational Geometry (SoCG) 1992, pp.138 - 145, 1992-06-10 |
| COMPUTING AND VERIFYING DEPTH ORDERS DEBERG, M; OVERMARS, M; Cheong, Otfried, SIAM JOURNAL ON COMPUTING, v.23, no.2, pp.437 - 446, 1994-04 |
| Computing based on quantum principles Bae, Joonwoo, Particle Physics in Computing Frontiers, Institute of Basic Sciences (IBS), 2019-12-13 |
| Computing Betweenness Centrality in B-hypergraphs Lee, Kwang Hee; Kim, Myoung Ho, ACM Conference on Information and Knowledge Management (CIKM), pp.2147 - 2150, ACM Special Interest Group on Information Retrieval (SIGIR), 2017-11-08 |
| Computing Convolutions on Mesh-Like Structures Cheong, Otfried, The 7th International Parallel Processing Symposium, pp.695 - 699, 1993-04-13 |
| Computing device and storage card Jung, Myoungsoo; Gouk, Donghyun; Kwon, Miryeong |
| Computing device for algorithm to reconstruct three-dimensional tomogram by considering multiple scattering, and method of the same Park, Yong Keun; Lee, Moosung; Herve Jerome Hugonnet |
Discover
Type
Open Access
Date issued
- 31,383 2020 - 2024
- 99,975 2010 - 2019
- 75,670 2000 - 2009
- 44,727 1990 - 1999
- 14,360 1980 - 1989
- 62 1964 - 1969