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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on software engineering 2014-02, Vol.40 (2), p.167-191
Hauptverfasser:	Trummer, Immanuel, Faltings, Boi, Binder, Walter
Format:	Artikel
Sprache:	eng
Schlagworte:	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
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!