ACM Home Page
Please provide us with feedback. Feedback
Matchmaking of web services based on the DAML-S service model
Full text PdfPdf (72 KB)
Source International Conference on Autonomous Agents archive
Proceedings of the second international joint conference on Autonomous agents and multiagent systems table of contents
Melbourne, Australia
POSTER SESSION: Posters table of contents
Pages: 926 - 927  
Year of Publication: 2003
ISBN:1-58113-683-8
Authors
Sharad Bansal  University of South Carolina, Columbia, SC
Jose M. Vidal  University of South Carolina, Columbia, SC
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 46,   Citation Count: 7
Additional Information:

abstract   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/860575.860728
What is a DOI?

ABSTRACT

DAML-S provides the means for a web service to advertise its functionality to potential users of the service. This brings to fore the issue of discovering an advertisement that best matches a request for a particular service---a process referred to as matchmaking. The algorithms that have thus far been proposed for matchmaking are based on comparisons of the requested and offered inputs and outputs. In this project, we extend these algorithms by taking into account the detailed process description of the service, thus leading to more accurate matchmaking.


CITED BY  7

Collaborative Colleagues:
Sharad Bansal: colleagues
Jose M. Vidal: colleagues