English  |  正體中文  |  简体中文  |  0  
???header.visitor??? :  52577248    ???header.onlineuser??? :  717
???header.sponsordeclaration???
 
臺灣學術機構典藏系統 (Taiwan Academic Institutional Repository, TAIR)
???ui.leftmenu.abouttair???

???ui.leftmenu.bartitle???

???index.news???

???ui.leftmenu.copyrighttitle???

???ui.leftmenu.link???

"s s tseng"???jsp.browse.items-by-author.description???

???jsp.browse.items-by-author.back???
???jsp.browse.items-by-author.order1??? ???jsp.browse.items-by-author.order2???

Showing items 191-225 of 225  (5 Page(s) Totally)
<< < 1 2 3 4 5 > >>
View [10|25|50] records per page

Institution Date Title Author
亞洲大學 1990 EMCUD: A knowledge acquisition method which captures embedded meanings under uncertainty G. J. Hwang ; S. S. Tseng
亞洲大學 1990 On the invariance of the male optimal stable matching R. T. Kuo ; S. S. Tseng
亞洲大學 1990 Elicitng embedded meanings in building expert systems under uncertainty G. J Hwang;S. S. Tseng
亞洲大學 1990 A parallel concept learning algorithm based upon version space strategy T. P. Hong;S. S. Tseng
亞洲大學 1990 A brain tumor diagnostic system with automatic learning abilities C. H. Wang;S. S. Tseng
亞洲大學 1990 Building a multi-purpose medical diagnostic system under uncertain and incomplete environment G. J Hwang;S. S. Tseng
亞洲大學 1990 Reliability-oriented task assignment in distributed systems with software redundancy G. J. Hwang;S. S. Tseng
亞洲大學 1990 A generalized learning problem T. P. Hong;S. S. Tseng
亞洲大學 1990 On the relocation problem with some constraints M. T. Lin;S. S. Tseng
亞洲大學 1990 An optimal partitioning in the star network with limited processors M. T. Chen;S. S. Tseng
亞洲大學 1989-03 A new data-dependence test algorithm S. J. Huang ; S. S. Tseng
亞洲大學 1989 Maximizing the number of spanning trees of networks based on cycle basis representation S. S. Tseng ; L. R. Wang
亞洲大學 1989 The average performance of a parallel stable marriage algorithm S. S. Tseng
亞洲大學 1989 The reciprocal stable matching problem and its properties R. T. Kuo ; S. S. Tseng
亞洲大學 1989 PEB: a probability based method for eliciting knowledge in brain tumor expert system S. S. Tseng;C. Y. Sun;M. M. H. Teng
亞洲大學 1989 A heuristic task assignment algorithm to maximize distributed system reliability G. J. Hwang;S. S. Tseng
亞洲大學 1989 The necessary and sufficient condition for the worst case male optimal stable matching R. T. Kuo;S. S. Tseng
亞洲大學 1988 Merging three sorted sequences of equal size three by six 3-sorters is optimal S. S. Tseng
亞洲大學 1988 Comments on a parallel algorithm to solve the stable marriage problem S. S. Tseng
亞洲大學 1988 A multidimensional sorting algorithm J. C. Lin;S. S. Tseng
亞洲大學 1988 The mutual influence between artificial intelligence and algorithm design R. C. T. Lee;S. S. Tseng;J. S. Wang
亞洲大學 1988 A faster algorithm for finding a minimum cycle basis of a graph M. T. Lin;S. S. Tseng
亞洲大學 1988 A new table-based knowledge acquisition method S. S. Tseng;G. J. Hwang
亞洲大學 1988 New algorithms for an N2α3β Latin square S. S. Tseng;S. W. Liu
亞洲大學 1988 A knowledge acquisition method that captures embedded meanings and uncertainties S. S. Tseng;G. J. Hwang
亞洲大學 1987 Merging three sorted sequences of equal size three by six 3-sorters is optimal S. S. Tseng
亞洲大學 1986 A review of stable marriage algorithms S. S. Tseng
亞洲大學 1986 The average performance of a parallel stable marriage algorithm S. S. Tseng
亞洲大學 1985-10 A review of parallel sorting algorithms S. S. Tseng ; R. C. T. Lee
亞洲大學 1985-01 The optimality of the number of k-sorters of a parallel merging algorithm S. S. Tseng ; R. C. T. Lee
亞洲大學 1985 A parallel sorting scheme whose operation sorts n elements S. S. Tseng ; R. C. T. Lee
亞洲大學 1984-09 A parallel algorithm to solve the stable marriage problem S. S. Tseng ; R. C. T. Lee
亞洲大學 1984-06 A new parallel sorting algorithm based upon min-mid-max operations S. S. Tseng ; R. C. T. Lee
亞洲大學 1982 On matrix multiplications S. S. Tseng
亞洲大學 1981 A new algorithm for noncommutative matrix multiplication S. S. Tseng;M. W. Du

Showing items 191-225 of 225  (5 Page(s) Totally)
<< < 1 2 3 4 5 > >>
View [10|25|50] records per page