Optimal robot scheduling for web search engines

DOI10.1002/(SICI)1099-1425(199806)1:1%3C15::AID-JOS3%3E3.0.CO;2-KMaRDI QIDQ1268846zbMATH OpenWikidataFDO

Authors Zhen Liu, Richard Weber, E. G. jun. Coffman

Publication date 8 April 1999

Published in Journal of Scheduling (Search for Journal in Brave)

zbMATH Keywords

stochastic orderingspidersstochastic schedulingweb search enginesrobot scheduling policiesweb robots

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Deterministic scheduling theory in operations research (90B35) Automated systems (robots, etc.) in control theory (93C85)

Recommendations

• Optimizing the number of robots for web search engines
• Optimal Allocation Of Heterogeneous Robots In World Wide Web Search Engines
• Optimization issues in web search engines
• Open-loop routeing to M parallel servers with no buffers
• scientific article; zbMATH DE number 2030062

Cited in

(7)

• Optimal Allocation Of Heterogeneous Robots In World Wide Web Search Engines
• Scheduling an autonomous robot searching for hidden targets
• scientific article; zbMATH DE number 2030062 (Why is no real title available?)
• Optimizing the number of robots for web search engines
• Optimization issues in web search engines
• Online searching with an autonomous robot
• Mathematical methods to study the polling systems

This page was built for publication: Optimal robot scheduling for web search engines

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