Composition of Web Services Using Markov Decision Processes and Dynamic Programming
We propose a Markov decision process model for solving the Web service composition (WSC) problem. Iterative policy evaluation, value iteration, and policy iteration algorithms are used to experimentally validate our approach, with artificial and real data. The experimental results show the reliabili...
Saved in:
Main Authors: | Víctor Uc-Cetina, Francisco Moo-Mena, Rafael Hernandez-Ucan |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2015-01-01
|
Series: | The Scientific World Journal |
Online Access: | http://dx.doi.org/10.1155/2015/545308 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Dynamic Watermarking for Finite Markov Decision Processes
by: Jiacheng Tang, et al.
Published: (2025-01-01) -
Research of service-differentiated admission control based on Markov decision processes in heterogeneous wireless networks
by: DENG Qiang1, et al.
Published: (2010-01-01) -
Approaches to Web Service Composition for the Semantic Web
by: Mohammed H. Ramadhan
Published: (2021-07-01) -
Feeding System’s Sensitivity and Reliability Analysis through Markov Decision Process
by: Sujata Jadhav, et al.
Published: (2025-04-01) -
Service chain-based approach for Web service composition
by: FU Yan-ning, et al.
Published: (2007-01-01)