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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on software engineering Ročník 40; číslo 2; s. 167 - 191
Hlavní autori:	Trummer, Immanuel, Faltings, Boi, Binder, Walter
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.02.2014 IEEE Computer Society
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!