Cart (Loading....) | Create Account
Close category search window
 

Optimization of Web Service Composition Using Factored Markov Decision Process

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chunhua Tao ; Sch. of Comput. Sci. & Technol., Tianjin Univ., Tianjin, China ; Zhiyong Feng ; Chao Xu

The service selection problem has gotten many attentions in Web service composition studies. This paper proposes a novel policy based solution to the service selection problem. A composite Web service is modeled as a factored Markov decision process (MDP), and its execution is under the control of an optimal policy, which is a solution of the factored MDP. A travel agent composite Web service shows that the policy based approach is stable and efficient.

Published in:

Computer Science and Engineering, 2009. WCSE '09. Second International Workshop on  (Volume:1 )

Date of Conference:

28-30 Oct. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.