OPUS at UTS: Browsing OPUS - Open Publications of UTS Scholars

Browsing byAuthorYeh, W

Showing results 52 to 71 of 79< previous next >

Issue Date	Title	Author(s)
2002-01	Real-Time Deadlock Detection And Recovery For Automated Manufacturing Systems	Yeh, W
1998-01	A Revised Layered-Network Algorithm To Search For All D-Minpaths Of A Limited-Flow Acyclic Network	Yeh, W
2002-01	Search For All D-Mincuts Of A Limited-Flow Network	Yeh, W
2003-01	Search For All Mcs In Networks With Unreliable Nodes And Arcs	Yeh, W
2001-01	Search For Mc In Modified Networks	Yeh, W
2002-01	Search For Minimal Paths In Modified Networks	Yeh, W
2011-01	A Sequential Decomposition Method for Estimating Flow in a Multi-Commodity, Multistate Network	Yeh, W
2004-01	A Simple Algorithm For Evaluating The K-Out-Of-N Network Reliability	Yeh, W
2001-01	A Simple Algorithm For The Planar Multiway Cut Problem	Yeh, W
2001-01	A Simple Algorithm To Search For All D-Mps With Unreliable Nodes	Yeh, W
2006-01	A Simple Algorithm To Search For All MCS In Networks	Yeh, W
2001-01	A Simple Approach To Search For All D-Mcs Of A Limited-Flow Network	Yeh, W
2002-01	A Simple Branch-And-Bound Algorithm For The K-Cut Problem For Applications With K Target Vertices, E.G. Vlsi Design	Yeh, W
2009-01	A Simple Direct Cosine Simplex Algorithm	Yeh, W; Corley, HW
2007-01	A Simple Heuristic Algorithm For Generating All Minimal Paths	Yeh, W
2004-01	A Simple Mc-Based Algorithm For Evaluating Reliability Of Stochastic-Flow Network With Unreliable Nodes	Yeh, W
2002-01	A Simple Method To Verify All d-Minimal Path Candidates Of A Limited-Flow Network And Its Reliability	Yeh, W
2008-01	A Simple Minimal Path Method For Estimating The Weighted Multi-Commodity Multistate Unreliable Networks Reliability	Yeh, W
2009-01	A Simple Universal Generating Function Method For Estimating The Reliability Of General Multi-State Node Networks	Yeh, W
2009-01	A Simple Universal Generating Function Method To Search For All Minimal Paths In Networks	Yeh, W

Showing results 52 to 71 of 79< previous next >