Improved Matchmaking Algorithm for Semantic Web Services Based on Bipartite Graph Matching

The ability to dynamically discover and invoke a Web service is a critical aspect of service oriented architectures. An important component of the discovery process is the matchmaking algorithm itself. In order to overcome the limitations of a syntax-based search, matchmaking algorithms based on sem...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Umesh Bellur, Kulkarni, R.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithm design and analysis Bipartite graph Information technology Logic Microstrip Ontologies Performance analysis Semantic Web Service oriented architecture Web services
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!