A composite service selection method supporting semantic matching based on bipartite graph

DOI10.3969/J.ISSN.1001-0505.2014.03.011MaRDI QIDQ5498218zbMATH OpenFDO

Authors

Publication date 11 February 2015

Full work available at URL https://doi.org/10.3969/J.ISSN.1001-0505.2014.03.011

zbMATH Keywords

composite servicegenetic algorithmsemantic matchingservice selection

Mathematics Subject Classification ID

Internet topics (68M11) Semantics in the theory of computing (68Q55) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A dynamic web services selection algorithm with QoS global optimal in web services composition
• A Petri net-based semantic Web service automatic composition method
• Semantic-based service matching algorithm in pervasive computing environments
• A service selection model based on multi-agent collaboration
• Automatic semantic web services composition based on complete backward tree

This page was built for publication: A composite service selection method supporting semantic matching based on bipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5498218)