Sciweavers

Share
AAMAS
2002
Springer

Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace

8 years 11 months ago
Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace
Service matchmaking among heterogeneous software agents in the Internet is usually done dynamically and must be efficient. There is an obvious trade-off between the quality and efficiency of matchmaking on the Internet. We define a language called Larks for agent advertisements and requests, and present a flexible and efficient matchmaking process that uses Larks. The Larks matchmaking process performs both syntactic and semantic matching, and in addition allows the specification of concepts (local ontologies) via ITL, a concept language. The matching process uses five different filters: context matching, profile comparison, similarity matching, signature matching and constraint matching. Different degrees of partial matching can result from utilizing different combinations of these filters. We briefly report on our implementation of Larks and the matchmaking process in Java. Fielded applications of matchmaking using Larks in several application domains for systems of information agent...
Katia P. Sycara, Seth Widoff, Matthias Klusch, Jia
Added 16 Dec 2010
Updated 16 Dec 2010
Type Journal
Year 2002
Where AAMAS
Authors Katia P. Sycara, Seth Widoff, Matthias Klusch, Jianguo Lu
Comments (0)
books