Showing results 32501 to 32520 of 278645
APPROXIMATING THE NUMBER OF UNIQUE VALUES OF AN ATTRIBUTE WITHOUT SORTING ASTRAHAN, MM; SCHKOLNICK, M; Whang, Kyu-Young, INFORMATION SYSTEMS, v.12, no.1, pp.11 - 15, 1987 |
Approximation algorithms for connected facility location problems Hasan, Mohammad Khairul; Jung, Hyunwoo; Chwa, Kyung Yong, JOURNAL OF COMBINATORIAL OPTIMIZATION, v.16, no.2, pp.155 - 172, 2008-08 |
Approximation algorithms for facility location and graph partitioning problems = 시설 배치와 그래프 분할 문제에 대한 근사 알고리즘link Mohammad Khairul Hasan; MK Hasan; Shin, Sung-Yong; 신성용; et al, 한국과학기술원, 2013 |
Approximation algorithms for general parallel task scheduling Chwa, Kyung Yong, Information Processing Letters, pp.143 - 150, 2002 |
Approximation algorithms for inscribing or circumscribing an axially symmetric polygon to a convex polygon Cheong, Otfried; Ahn, Hee-Kap; Brass, Peter; Na, Hyeon-Suk; Shin, Chan-Su; Vigneron, Antoine, 10th Annual Intern. Computing and Combinatorics Conference (COCOON) 2004, pp.259 - 268, 2004-08-18 |
Approximation algorithms for inscribing or circumscribing an axially symmetric polygon to a convex polygon Ahn, HK; Brass, P; Cheong, Otfried; Na, HS; Shin, CS; Vigneron, A, COMPUTING AND COMBINATORICS, PROCEEDINGS BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.3106, pp.259 - 267, 2004 |
Approximation algorithms for scheduling parallel tasks = 병렬 태스크의 스케쥴링을 위한 근사적 알고리즘link Kwon, Oh-Heum; 권오흠; et al, 한국과학기술원, 1996 |
Approximation algorithms for the Weighted t-Uniform Sparsest Cut and some other graph partitioning problems Hasan, Mohammad Khairul; Chwa, Kyung-Yong, JOURNAL OF COMPUTER AND SYSTEM SCIENCES, v.82, no.6, pp.1044 - 1063, 2016-09 |
Approximation Algorithms for Two-Dimensional Bin Packing Kim, MJ; Shin, Sung-Yong; Lee, HK, Proc. Tech. conference on computer Graphics and Design Automation, pp.24 - 32, 1989 |
Approximation analysis for a multi-inflow tandem queueing model with blocking and unreliable servers = 여러 입력창구를 갖고 정체현상과 서어버의 고장을 고려한 직렬대가모형의 근사적 해법연구link Cho, Mun-Hwi; 조문휘; et al, 한국과학기술원, 1990 |
Approximation Analysis of time-dependent queue sige distribution for $GI/G/m$ system rsing diffusion processes 최봉대, Proceedings of International Math. Workshop an KAIST, pp.225 - 242, 1991 |
Approximation and analysis of confuent hypergeometric differential equation in homing guidance = 호밍가이드 시스템에서 합류초기하 방정식의 근사와 해석link Ko, Min-Su; 고민수; et al, 한국과학기술원, 2011 |
Approximation and analysis of confuent hypergeometric differential equation in homing guidance = 호밍가이드 시스템에서 합류초기하 방정식의 근사와 해석link Ko, Min-Su; 고민수; et al, 한국과학기술원, 2011 |
Approximation for waiting time and its application to fab-level preventive maintenance plan optimization = 큐잉 네트워크 분석을 통한 팹 레벨에서의 예방 정비 활동 최적화link Shin, Jinho; 신진호; et al, 한국과학기술원, 2016 |
Approximation method for sojourn time distributions in telecommunication networks You, Jae Uck; Chung, Min Young; Sung, Dan Keun, Proceedings of the 1998 IEEE International Conference on Communications, ICC. Part 3 (of 3), v.3, pp.1473 - 1477, 1998-06-07 |
Approximation method for the calculation of stress intensity factors for the semi-elliptical surface flaws on thin-walled cylinder Jang, Changheui, JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY, v.20, no.3, pp.319 - 328, 2006-03 |
Approximation of circular arcs by Bezier curves Kim, Hong Oh, JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, v.81, no.1, pp.145 - 163, 1997-07 |
Approximation of convex figures by pairs of rectangles Cheong, Otfried; Fuchs, Ulrich; Rote, Gtinter; Welzl, Emo, 7th Annual Symposium on Theoretical Aspects of Computer Science (STACS 1990), pp.240 - 249, 1990-02-22 |
Approximation of convex figures by pairs of rectangles Cheong, Otfried; Fuchs, U; Rote, G; Welzl, E, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.10, no.2, pp.77 - 87, 1998-05 |
Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points Lee, Jae-Ha; Cheong, Otfried; Kwon, Woo-Cheol; Shin, Sung-Yong; Chwa, Kyung Yong, 8th European Symposium on Algorithms, pp.314 - 325, 2000-09-05 |
Discover