DSpace
KOBRA
KOBRA

KOBRA - Dokumentenserver der Universität Kassel  → Fachbereiche  → FB 16 Elektrotechnik / Informatik  → Kasseler Informatikschriften (KIS)  

Bitte benutzen Sie diese Kennung, um auf die Ressource zu verweisen:
http://nbn-resolving.de/urn:nbn:de:hebis:34-2007111919638

Titel: Web Service Composition Systems for the Web Service Challenge - A Detailed Review
Autor(en): Weise, ThomasBleul, SteffenGeihs, Kurt
Klassifikation (DDC): 004 - Informatik (Data processing Computer science)
Erscheinungsdatum: 19-Nov-2007
Serie/Report Nr.: Kasseler Informatikschriften2007, 7
Zusammenfassung: This report gives a detailed discussion on the system, algorithms, and techniques that we have applied in order to solve the Web Service Challenges (WSC) of the years 2006 and 2007. These international contests are focused on semantic web service composition. In each challenge of the contests, a repository of web services is given. The input and output parameters of the services in the repository are annotated with semantic concepts. A query to a semantic composition engine contains a set of available input concepts and a set of wanted output concepts. In order to employ an offered service for a requested role, the concepts of the input parameters of the offered operations must be more general than requested (contravariance). In contrast, the concepts of the output parameters of the offered service must be more specific than requested (covariance). The engine should respond to a query by providing a valid composition as fast as possible. We discuss three different methods for web service composition: an uninformed search in form of an IDDFS algorithm, a greedy informed search based on heuristic functions, and a multi-objective genetic algorithm.
URI: urn:nbn:de:hebis:34-2007111919638
Bemerkungen: Data-Mining-Cup 2007
Sammlung(en):Kasseler Informatikschriften (KIS)

Dateien zu dieser Ressource:

Datei Beschreibung GrößeFormat
Technicalreport2007_7.pdf431,84 kBAdobe PDFÖffnen/Anzeigen

Alle Ressourcen in diesem Repository sind urheberrechtlich geschützt.