|
English
|
正體中文
|
简体中文
|
總筆數 :0
|
|
造訪人次 :
50907314
線上人數 :
649
教育部委託研究計畫 計畫執行:國立臺灣大學圖書館
|
|
|
"tseng ss"的相關文件
顯示項目 76-85 / 99 (共10頁)
<< < 1 2 3 4 5 6 7 8 9 10 > >>
每頁顯示[10|25|50]項目
| 國立交通大學 |
2014-12-08T15:06:17Z |
A NEW PARALLEL SORTING ALGORITHM BASED UPON MIN-MID-MAX OPERATIONS
|
TSENG, SS; LEE, RCT |
| 國立交通大學 |
2014-12-08T15:06:17Z |
A PARALLEL ALGORITHM TO SOLVE THE STABLE MARRIAGE PROBLEM
|
TSENG, SS; LEE, RCT |
| 國立交通大學 |
2014-12-08T15:06:13Z |
A PARALLEL SORTING SCHEME WHOSE BASIC OPERATION SORTS N ELEMENTS
|
TSENG, SS; LEE, RCT |
| 國立交通大學 |
2014-12-08T15:05:54Z |
THE AVERAGE PERFORMANCE OF A PARALLEL STABLE MARRIAGE ALGORITHM
|
TSENG, SS |
| 國立交通大學 |
2014-12-08T15:05:54Z |
MAXIMIZING THE NUMBER OF SPANNING-TREES OF NETWORKS BASED ON CYCLE BASIS REPRESENTATION
|
TSENG, SS; WANG, LR |
| 國立交通大學 |
2014-12-08T15:05:54Z |
MAXIMIZING THE NUMBER OF SPANNING-TREES OF NETWORKS BASED ON CYCLE BASIS REPRESENTATION
|
TSENG, SS; WANG, LR |
| 國立交通大學 |
2014-12-08T15:05:40Z |
ON THE INVARIANCE OF MALE OPTIMAL STABLE MATCHING
|
KUO, RT; TSENG, SS |
| 國立交通大學 |
2014-12-08T15:05:34Z |
THE NECESSARY AND SUFFICIENT CONDITION FOR THE WORST-CASE MALE OPTIMAL STABLE MATCHING
|
KUO, RT; TSENG, SS |
| 國立交通大學 |
2014-12-08T15:05:23Z |
SOME RESULTS OF THE RELOCATION PROBLEMS WITH PROCESSING TIMES AND DEADLINES
|
LIN, MT; TSENG, SS |
| 國立交通大學 |
2014-12-08T15:05:21Z |
STABLE MATCHING WITH SPECIAL PREFERENCE PATTERNS
|
KUO, RT; TSENG, SS |
顯示項目 76-85 / 99 (共10頁)
<< < 1 2 3 4 5 6 7 8 9 10 > >>
每頁顯示[10|25|50]項目
|
