1. Adelaide Research & Scholarship

Search


Current filters:

Start a new search
Add filters:

Use filters to refine the search results.

 | 
Results 1-10 of 11 (Search time: 0.002 seconds).
Item hits:
PreviewIssue DateTitleAuthor(s)
2020A service computing framework for proteomics analysis and collaboration of pathogenic mechanism studiesChen, H.; Li, F.; Sun, G.; Zhang, X.; Dong, X.; Wang, L.; Liao, K.; Shen, H.; Shen, J.; IEEE International Conference on Services Computing (SCC) (18 Oct 2020 - 24 Oct 2020 : virtual online)
2012Approximating the reliable resource allocation problem using inverse dual fittingLiao, K.; Shen, H.; Computing: The Australasian Theory Symposium (18th : 2012 : Melbourne)
2013Improved approximation algorithms for constrained fault-tolerant resource allocationLiao, K.; Shen, H.; Guo, L.; International Symposium on Fundamentals of Computation Theory (19th : 2013 : Liverpool, UK)
2015Brief announcement: efficient approximation algorithms for computing k disjoint restricted shortest pathsGuo, L.; Shen, H.; Liao, K.; Li, P.; 27th ACM symposium on Parallelism in Algorithms and Architectures (SPAA) (13 Jun 2015 - 15 Jun 2015 : Portland, OR)
2015On the shallow-light Steiner tree problemGuo, L.; Liao, K.; Shen, H.; 15th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) (9 Dec 2014 - 11 Dec 2014 : Hong Kong, China)
2015Improved approximation algorithms for computing k disjoint paths subject to two constraintsGuo, L.; Shen, H.; Liao, K.
2015Improved approximation algorithms for constrained fault-tolerant resource allocationLiao, K.; Shen, H.; Guo, L.
2014LP-based approximation algorithms for reliable resource allocationLiao, K.; Shen, H.
2011Unconstrained and constrained fault-tolerant resource allocationLiao, K.; Shen, H.; International Computing & Combinatorics Conference (17th : 2011 : Dallas, Texas)
2013Improved approximation algorithms for computing k disjoint paths subject to two constraintsGuo, L.; Shen, H.; Liao, K.; International Computing and Combinatorics Conference (19th : 2013 : Hangzhou)

Discover