TY - GEN
T1 - IMPACT
T2 - 1998 International Conference on Multi Agent Systems, ICMAS 1998
AU - Arisha, Khaled
AU - Ozcan, Fatma
AU - Ross, Robert
AU - Kraus, Sarit
AU - Subrahmanian, V. S.
N1 - Funding Information:
DAAH-04-95-10174, DAAH-04-96-10297, and DAAH04-96-1-0398, by the Army Research Laboratory under contract number DAALO1-97-K0135, and by an NSF Young Investigator award IRI-93-57756.
Funding Information:
‘This work was supported by the Amy Research Office under Grants
Publisher Copyright:
© 1998 IEEE.
PY - 1998
Y1 - 1998
N2 - We describe a platform called IMPACT to support multiagent interactions. The platform provides a set of servers (yellow pages, thesaurus, registration, type, and interface) that facilitate agent interoperability in an application independent manner. In IMPACT agents have an associated set of service descriptions, specifying the services they provide. We develop an HTML-like language for such service descriptions. When an agent wishes to identify another agent that provides a service, the requested service must be matched, using a metric approach, against existing service descriptions. We provide a formal framework within which this may be done, and develop algorithms to compute the k nearest matches, as well as all matches within a given distance from the requested service. We report on experiments evaluating our algorithms with large data sets.
AB - We describe a platform called IMPACT to support multiagent interactions. The platform provides a set of servers (yellow pages, thesaurus, registration, type, and interface) that facilitate agent interoperability in an application independent manner. In IMPACT agents have an associated set of service descriptions, specifying the services they provide. We develop an HTML-like language for such service descriptions. When an agent wishes to identify another agent that provides a service, the requested service must be matched, using a metric approach, against existing service descriptions. We provide a formal framework within which this may be done, and develop algorithms to compute the k nearest matches, as well as all matches within a given distance from the requested service. We report on experiments evaluating our algorithms with large data sets.
UR - http://www.scopus.com/inward/record.url?scp=85053151042&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85053151042&partnerID=8YFLogxK
U2 - 10.1109/ICMAS.1998.699225
DO - 10.1109/ICMAS.1998.699225
M3 - Conference contribution
AN - SCOPUS:85053151042
SN - 081868500X
SN - 9780818685002
T3 - Proceedings - International Conference on Multi Agent Systems, ICMAS 1998
SP - 385
EP - 386
BT - Proceedings - International Conference on Multi Agent Systems, ICMAS 1998
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 3 July 1998 through 7 July 1998
ER -