A Graph-based QoS-Aware Method for Web Service Composition with Branching

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

  author =       "Alexandre Sawczuk {da Silva} and Hui Ma and 
                 Mengjie Zhang",
  title =        "A Graph-based {QoS}-Aware Method for Web Service
                 Composition with Branching",
  booktitle =    "GECCO '16 Companion: Proceedings of the Companion
                 Publication of the 2016 Annual Conference on Genetic
                 and Evolutionary Computation",
  year =         "2016",
  editor =       "Tobias Friedrich and Frank Neumann and 
                 Andrew M. Sutton and Martin Middendorf and Xiaodong Li and 
                 Emma Hart and Mengjie Zhang and Youhei Akimoto and 
                 Peter A. N. Bosman and Terry Soule and Risto Miikkulainen and 
                 Daniele Loiacono and Julian Togelius and 
                 Manuel Lopez-Ibanez and Holger Hoos and Julia Handl and 
                 Faustino Gomez and Carlos M. Fonseca and 
                 Heike Trautmann and Alberto Moraglio and William F. Punch and 
                 Krzysztof Krawiec and Zdenek Vasicek and 
                 Thomas Jansen and Jim Smith and Simone Ludwig and JJ Merelo and 
                 Boris Naujoks and Enrique Alba and Gabriela Ochoa and 
                 Simon Poulding and Dirk Sudholt and Timo Koetzing",
  pages =        "131--132",
  month =        "20-24 " # jul,
  organisation = "SIGEVO",
  address =      "Denver, USA",
  publisher =    "ACM",
  keywords =     "genetic algorithms, genetic programming: Poster",
  publisher_address = "New York, NY, USA",
  isbn13 =       "978-1-4503-4323-7",
  DOI =          "doi:10.1145/2908961.2909044",
  abstract =     "Service-Oriented Architecture, where individual
                 services can be combined to accomplish more complex
                 tasks, provides a flexible and reusable approach to
                 application development. Their composition can be
                 performed manually, however doing so may prove to be
                 challenging if many service alternatives with differing
                 qualities are available. Evolutionary Computation (EC)
                 techniques have been employed successfully to tackle
                 this problem, especially Genetic Programming (GP),
                 since it is capable of encoding conditional constraints
                 on the composition's execution paths. While
                 compositions can naturally be represented as Directed
                 Acyclic Graphs (DAGs), GP needs to encode candidates as
                 trees, which may pose conversion difficulties. To
                 address that, this work proposes a Quality of Service
                 (QoS)-aware EC composition approach that represents
                 solutions directly as DAGs. This approach extends a
                 previously proposed DAG representation by allowing it
                 to also encode conditional constructs, thus producing
                 solutions with multiple possible execution paths. The
                 tree-based and graph-based composition approaches are
                 compared, showing significant gains in execution time
                 when using graphs.",
  notes =        "Distributed at GECCO-2016.",

Genetic Programming entries for Alexandre Sawczuk da Silva Hui Ma Mengjie Zhang