HomeResearch-feedChannelRankingsGCTTHU AI TROpen DataMust Reading

Optimal Freshness Crawl Under Politeness Constraints

Andrey Kolobov
Andrey Kolobov
Yuval Peres
Yuval Peres
Eyal Lubetzky
Eyal Lubetzky
Eric Horvitz
Eric Horvitz

Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 495-504, 2019.

Cited by: 5|Bibtex|Views31|DOI:https://doi.org/10.1145/3331184.3331241
EI
Other Links: dl.acm.org|dblp.uni-trier.de|academic.microsoft.com
Keywords:
convex optimization lagrange multiplier planning under uncertainty politeness constraint search engineMore(1+)

Abstract:

A Web crawler is an essential part of a search engine that procures information subsequently served by the search engine to its users. As the Web is becoming increasingly more dynamic, in addition to discovering new web pages a crawler needs to keep revisiting those already in the search engine's index, in order to keep the index fresh by...More

Code:

Data:

Your rating :
0

 

Tags
Comments