|
|
Taiwan Academic Institutional Repository >
Browse by Author
|
"hwang fk"
Showing items 61-85 of 92 (4 Page(s) Totally)
<< < 1 2 3 4 > >>
View [10|25|50] records per page
| 國立交通大學 |
2014-12-08T15:39:57Z |
A general approach to compute the probabilities of unresolved clones in random pooling designs
|
Hwang, FK; Liu, YC |
| 國立交通大學 |
2014-12-08T15:39:51Z |
Equivalence of the 1-rate model to the classical model on strictly nonblocking switching networks
|
Chen, WR; Hwang, FK; Zhu, XD |
| 國立交通大學 |
2014-12-08T15:39:40Z |
Decomposing complete graphs into K-r x K-c's
|
Fu, HL; Hwang, FK; Jimbo, M; Mutoh, Y; Shiue, CL |
| 國立交通大學 |
2014-12-08T15:39:21Z |
Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies
|
Chang, FH; Guo, JY; Hwang, FK; Lin, CK |
| 國立交通大學 |
2014-12-08T15:38:41Z |
Permutation polytopes corresponding to strongly supermodular functions
|
Hwang, FK; Lee, JS; Rothblum, UG |
| 國立交通大學 |
2014-12-08T15:37:00Z |
Partition-optimization with Schur convex sum objective functions
|
Hwang, FK; Rothblum, UG |
| 國立交通大學 |
2014-12-08T15:36:17Z |
Strict nonblockingness of reduced shuffle-exchange networks
|
Hwang, FK; Zhang, BW |
| 國立交通大學 |
2014-12-08T15:35:46Z |
The optimal consecutive-k-out-of-n : G line for n <= 2k
|
Jalali, A; Hawkes, AG; Cui, LR; Hwang, FK |
| 國立交通大學 |
2014-12-08T15:27:13Z |
Characterizing bit permutation networks
|
Chang, GJ; Hwang, FK; Tong, LD |
| 國立交通大學 |
2014-12-08T15:26:51Z |
A general construction for nonblocking crosstalk-free photonic switching networks
|
Hwang, FK; Lin, WD |
| 國立交通大學 |
2014-12-08T15:25:40Z |
Online discussion on a virtual physics forum: A content analysis
|
Guan, YH; Tsai, CC; Hwang, FK |
| 國立交通大學 |
2014-12-08T15:19:33Z |
A hierarchy of importance indices
|
Hwang, FK |
| 國立交通大學 |
2014-12-08T15:19:16Z |
On 3-stage Clos networks with different nonblocking requirements on two types of calls
|
Fu, HL; Hwang, FK |
| 國立交通大學 |
2014-12-08T15:19:08Z |
An almost-linear time and linear space algorithm for the longest common subsequence problem
|
Guo, JY; Hwang, FK |
| 國立交通大學 |
2014-12-08T15:18:52Z |
A competitive algorithm to find all defective edges in a graph
|
Hwang, FK |
| 國立交通大學 |
2014-12-08T15:18:29Z |
A unifying approach to determine the necessary and sufficient conditions for nonblocking multicast 3-stage Clos networks
|
Hwang, FK |
| 國立交通大學 |
2014-12-08T15:18:11Z |
Supermodularity in mean-partition problems
|
Chang, FH; Hwang, FK |
| 國立交通大學 |
2014-12-08T15:18:02Z |
Equivalence of buddy networks with arbitrary number of stages
|
Chen, CY; Hwang, FK; Lan, JK |
| 國立交通大學 |
2014-12-08T15:17:55Z |
Necessary and sufficient conditions for rearrangeable Log(d) (N, m, p)
|
Hwang, FK; Lin, WD |
| 國立交通大學 |
2014-12-08T15:17:41Z |
On multicast rearrangeable 3-stage Clos networks without first-stage fan-out
|
Chen, HB; Hwang, FK |
| 國立交通大學 |
2014-12-08T15:17:06Z |
Wide-sense nonblocking for multi-log(d) N networks under various routing strategies
|
Chang, FH; Guo, JY; Hwang, FK |
| 國立交通大學 |
2014-12-08T15:17:05Z |
Rearrangebility of bit permutation networks
|
Bao, XW; Hwang, FK; Li, Q |
| 國立交通大學 |
2014-12-08T15:16:45Z |
New construction for transversal design
|
Du, DZ; Hwang, FK; Wu, WL; Znati, T |
| 國立交通大學 |
2014-12-08T15:16:45Z |
One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions
|
Chang, FH; Chen, HB; Guo, JY; Hwang, FK; Rothblum, UG |
| 國立交通大學 |
2014-12-08T15:16:21Z |
Tessellating polyominos in the plane
|
Chen, MY; Hwang, FK; Yen, CH |
Showing items 61-85 of 92 (4 Page(s) Totally)
<< < 1 2 3 4 > >>
View [10|25|50] records per page
|
