By Topic

Effectiveness of cooperative resource collecting robots for Web search engines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kamei, S. ; Kyoto Univ., Japan ; Kawano, H. ; Hasegawa, T.

In this paper, we consider cooperative resource collecting robots in web space. Especially, we discuss the effectiveness of algorithm to share domains among several robots in the network. We define the cost model for documents retrieval system by the product of the size of document and the distance from each site to each robot. The algorithm to minimize the collecting time resolves itself into multi processor scheduling problem, which is one of famous NP complete problems. Hence, we propose approximation algorithm which is based on greedy method. Consequently, we estimate that the length of collecting time can be reduced from 1/3 to 1/6 to collect almost all web documents in Japan

Published in:

Communications, Computers and Signal Processing, 1997. 10 Years PACRIM 1987-1997 - Networking the Pacific Rim. 1997 IEEE Pacific Rim Conference on  (Volume:1 )

Date of Conference:

20-22 Aug 1997