loading...
A Dynamic Generation Algorithm for Meta Process Using Markov Decision Processes
Hangzhou, Zhejiang, China June 20-June 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IMSCCS.2006.52006 First International Multi-Sympos ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Qi Sui, Shandong University, China
Hai-yang Wang, Shandong University, China
This paper introduced concepts of Meta Services and Meta Process, which can largely simplify the complexity of travel services composition. And corresponding to these concepts, a dynamic generation algorithm for meta process is presented instead of predefining a rigorous workflow model, which used Markov Decision Processes (MDP) referring to transition probability of meta service and the tourists? preference represented by preference reward function. And differently with some AI planning method, this approach more adept to the stochastic and dynamic environment and deals with the various requirements of tourists more effectively and flexibly. Additional this approach also can resolve similar problems in other services computing domain.
Index Terms:
Services Computing, Services Composition, Markov Decision Processes
Citation:
Qi Sui, Hai-yang Wang, "A Dynamic Generation Algorithm for Meta Process Using Markov Decision Processes," imsccs, vol. 1, pp.589-594, 2006 First International Multi-Symposiums on Computer and Computational Sciences, 2006
Usage of this product signifies your acceptance of the Terms of Use.