Optimal robot scheduling for web search engines

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1099-1425(199806)1:1<15::AID-JOS3>3.0.CO;2-K" /><15::AID-JOS3>3.0.CO;2-K 10.1002/(SICI)1099-1425(199806)1:1<15::AID-JOS3>3.0.CO;2-KzbMath0909.90174WikidataQ56420571 ScholiaQ56420571MaRDI QIDQ1268846

Richard R. Weber, Zhen Liu, Edward G. jun. Coffman

Publication date: 8 April 1999

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

zbMATH Keywords

stochastic orderingstochastic schedulingspidersweb search enginesrobot scheduling policiesweb robots

Mathematics Subject Classification ID

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

Related Items (2)

Mathematical methods to study the polling systems ⋮ Optimal Allocation Of Heterogeneous Robots In World Wide Web Search Engines

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