A relaxable service selection algorithm for QoS-based web service composition
Authors:
- 1 December 2011
- journal article
- Published by Elsevier in Information and Software Technology
- Vol. 53 (12) , 1370-1381
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- An Efficient WS-QoS Broker Based Architecture for Web Services SelectionInternational Journal of Computer Applications, 2010
- Quality-of-service oriented web service composition algorithm and planning architectureJournal of Systems and Software, 2008
- A framework for QoS-aware binding and re-binding of composite web servicesJournal of Systems and Software, 2008
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problemComputers & Operations Research, 2008
- Efficient algorithms for Web services selection with end-to-end QoS constraintsACM Transactions on the Web, 2007
- A New Heuristic for Solving the Multichoice Multidimensional Knapsack ProblemIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 2005
- A survey on web services compositionInternational Journal of Web and Grid Services, 2005
- QoS-aware middleware for Web services compositionIEEE Transactions on Software Engineering, 2004
- QoS-Aware and Federated Enhancement for UDDIInternational Journal of Web Services Research, 2004
- The complexity and approximability of finding maximum feasible subsystems of linear relationsTheoretical Computer Science, 1995