An Approach to Web Services Selection for Multiple Users

Web service selection for multiple users is an important aspect for achieving efficient operations for web service applications. Its aim is to select optimal solutions, in which each abstract web service in the workflow of a web application is bound to its corresponding concrete web service with the...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE access Ročník 5; s. 15093 - 15104
Hlavní autoři:	Zhu, Wenlong, Yin, Beibei, Gong, Siqian, Cai, Kai-Yuan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 01.01.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Advanced a-fully polynomial time approximation scheme Algorithm design and analysis Applications programs Approximation algorithms artificial bee colony algorithm Genetic algorithms Internet service providers Mathematical analysis multiple users Pareto optimal set Pareto optimization Pareto optimum Planning Polynomials Quality of service Search algorithms Swarm intelligence User requirements web service selection Web services Workflow
ISSN:	2169-3536, 2169-3536
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!