An event-driven algorithm for agents on the web

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter describes how meta-agents in a multi-agent system can be used to effectively search for services in networks with an event-driven algorithm. These services can be attained in a range of different ways, including a simultaneous combination of several services in order to optimize costs and time. A challenge with a network is finding and extracting an optimal combination of the different services to implement a complex requested service. To solve this problem, it is possible to develop multi-agent systems in which the task steers the agents. While finding information on the web, the search path becomes an event-driven algorithm. The algorithm acts as a search method to extract information from several different services. Once built up, the algorithm can guide future search and optimize the searching. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Håkansson, A. (2009). An event-driven algorithm for agents on the web. Studies in Computational Intelligence, 170, 147–174. https://doi.org/10.1007/978-3-540-88049-3_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free