• Composition of Web Services Using Markov Decision Processes and Dynamic Programming 

      VICTOR EMANUEL DE ATOCHA UC CETINA; FRANCISCO JOSE MOO MENA; RAFAEL HERNANDEZ UCAN
      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 ...
    • Web service composition using the bidirectional Dijkstra algorithm 

      FRANCISCO JOSE MOO MENA; RAFAEL HERNANDEZ UCAN; VICTOR EMANUEL DE ATOCHA UC CETINA; FRANCISCO ALEJANDRO MADERA RAMIREZ
      Web services are not always able to fulfill customer requirements on their own, so in those cases it can choose to make a composition of web services. However, this is a complex problem since it must take into account the ...