| * | 2009 |
|---|
| 14 | EE | Wei-Chang Yeh,
H. W. Corley:
A simple direct cosine simplex algorithm.
Applied Mathematics and Computation 214(1): 178-186 (2009) |
| 13 | EE | Her-Shing Wang,
Wei-Chang Yeh,
Pei-Chiao Huang,
Wei-Wen Chang:
Using association rules and particle swarm optimization approach for part change.
Expert Syst. Appl. 36(4): 8178-8184 (2009) |
| 12 | EE | Wei-Chang Yeh,
Wei-Wen Chang,
Yuk Ying Chung:
A new hybrid approach for mining breast cancer pattern using discrete particle swarm optimization and statistical method.
Expert Syst. Appl. 36(4): 8204-8211 (2009) |
| 11 | EE | Wei-Chang Yeh:
A two-stage discrete particle swarm optimization for the problem of multiple multi-level redundancy allocation in series systems.
Expert Syst. Appl. 36(5): 9192-9200 (2009) |
| 2008 |
|---|
| 10 | EE | Changseok Bae,
Yuk Ying Chung,
Mohd Afizi Mohd Shukran,
Eric Choi,
Wei-Chang Yeh:
An intelligent classif ication algorithm for LifeLog multimedia applications.
MMSP 2008: 558-562 |
| 9 | EE | Wei-Chang Yeh:
A Greedy Branch-and-Bound Inclusion-Exclusion Algorithm for Calculating the Exact Multi-State Network Reliability.
IEEE Transactions on Reliability 57(1): 88-93 (2008) |
| 8 | EE | Wei-Chang Yeh:
The Extension of Universal Generating Function Method to Search for All One-to-Many d -Minimal Paths of Acyclic Multi-State-Arc Flow-Conservation Networks.
IEEE Transactions on Reliability 57(1): 94-102 (2008) |
| 2007 |
|---|
| 7 | EE | Wei-Chang Yeh:
Evaluation of all one-to-many reliabilities for acyclic multistate-node distributed computing system under cost and capacity constraints.
Computer Communications 30(18): 3796-3806 (2007) |
| 2006 |
|---|
| 6 | EE | Wei-Chang Yeh:
A simple algorithm to search for all MCs in networks.
European Journal of Operational Research 174(3): 1694-1705 (2006) |
| 2005 |
|---|
| 5 | EE | Wei-Chang Yeh:
A New Sum-of-Disjoint-Products Technique to Determine Network Reliabilities with Known Minimal Paths.
ICITA (2) 2005: 734-738 |
| 2002 |
|---|
| 4 | EE | Wei-Chang Yeh:
Search for all d-Mincuts of a limited-flow network.
Computers & OR 29(13): 1843-1858 (2002) |
| 2001 |
|---|
| 3 | EE | Wei-Chang Yeh:
Search for MC in modified networks.
Computers & OR 28(2): 177-184 (2001) |
| 2 | | Wei-Chang Yeh:
A Simple Algorithm for the Planar Multiway Cut Problem.
J. Algorithms 39(1): 68-77 (2001) |
| 1999 |
|---|
| 1 | EE | Wei-Chang Yeh:
A new branch-and-bound approach for the n/2/flowshop/alphaF+betaCmax flowshop scheduling problem.
Computers & OR 26(13): 1293-1310 (1999) |
