Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

The goal of multi-objective quality-driven service selection (QDSS) is to find service selections for a workflow whose quality-of-service (QoS) values are Pareto-optimal. We consider multiple QoS attributes such as response time, cost, and reliability. A selection is Pareto-optimal if no other selec...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on software engineering Vol. 40; no. 2; pp. 167 - 191
Main Authors:	Trummer, Immanuel, Faltings, Boi, Binder, Walter
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.02.2014 IEEE Computer Society
Subjects:	Algorithms Approximation Approximation algorithms Approximation methods Complexity Complexity theory Decision making models Equivalence Mathematical analysis Motion pictures multi-objective optimization Optimization Optimization algorithms Pareto optimum Permissible error Polynomials Quality of service Quality-driven service selection Randomized algorithms Studies Workflow software
ISSN:	0098-5589, 1939-3520
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!