A Genetic Programming-Based Algorithm for Composing Web Services

Created by W.Langdon from gp-bibliography.bib Revision:1.3872

@InProceedings{Mucientes:2009:ISDA,
  author =       "Manuel Mucientes and Manuel Lama and Miguel I. Couto",
  title =        "A Genetic Programming-Based Algorithm for Composing
                 Web Services",
  booktitle =    "Ninth International Conference on Intelligent Systems
                 Design and Applications, ISDA '09",
  year =         "2009",
  month =        nov # " 30-" # dec # " 2",
  address =      "Piza, Italy",
  pages =        "379--384",
  keywords =     "genetic algorithms, genetic programming, SBSE, Web
                 protocols, Web services composition, context-free
                 grammar, genetic programming-based algorithm, network
                 accessible, search process, Web services, context-free
                 grammars, information retrieval, protocols",
  URL =          "http://www.gsi.dec.usc.es/mucientes/pubs/Mucientes09_isda.pdf",
  DOI =          "doi:10.1109/ISDA.2009.155",
  abstract =     "Web services are interfaces that describe a collection
                 of operations that are network-accessible through
                 standardized Web protocols. When a required operation
                 is not found, several services can be compounded to get
                 a composite service that performs the desired task. To
                 find this composite service, a search process over a
                 huge search space must be performed. The algorithm that
                 composes the services must select the adequate atomic
                 processes and, also, must choose the correct way to
                 combine them using the different available control
                 structures. In this paper a genetic programming
                 algorithm for Web services composition is presented.
                 The algorithm has a context-free grammar to generate
                 the valid structures of the composite services.
                 Moreover, it includes a method to update the attributes
                 of each node. A full experimental validation with a
                 repository of 1,000 Web services has been done, showing
                 a great performance as the algorithm finds a valid
                 solution in all the tests.",
  notes =        "p379 {"}it is possible to compose a new service
                 automatically{"}. Steepest ascent Local search. CHC.
                 BNF? p384 {"}in all the test examples and acceptable
                 solution has be found in all the runs{"}. Also known as
                 \cite{5364880}",
}

Genetic Programming entries for Manuel Mucientes Molina Manuel Lama Penin Miguel Ixen Couto Perez

Citations