Optimal Allocation Of Heterogeneous Robots In World Wide Web Search Engines

DOI10.1080/0020716031000112349zbMATH Open1083.90025OpenAlexW2115297322MaRDI QIDQ4454319FDOQ4454319

Keqin Li

Publication date: 8 March 2004

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020716031000112349

Recommendations

• Optimizing the number of robots for web search engines
• Optimal robot scheduling for web search engines
• Optimal Information Gathering on the Internet with Time and Cost Constraints
• Optimization issues in web search engines
• Analysis of some algorithms of Web-sites searching

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• Optimal robot scheduling for web search engines
• Title not available (Why is that?)
• Optimizing the number of robots for web search engines

Cited In (3)

• Optimizing the number of robots for web search engines
• Analysis of some algorithms of Web-sites searching
• Optimization issues in web search engines

This page was built for publication: Optimal Allocation Of Heterogeneous Robots In World Wide Web Search Engines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4454319)