HIGHLIGHTS
- who: Kausthub Keshava and colleagues from the University of Montpellier, Montpellier, France have published the research: Optimal Prefetching in Random Trees, in the Journal: Mathematics 2021, 9, 2437. of /2021/
- what: The authors propose and analyze a model for optimizing the prefetching of documents in the situation where the connection between documents is discovered progressively. The aim of this paper is to provide such a benchmark situation, by determining the optimal policy and the minimal possible cost it induces, to which heuristics and learning algorithms can be compared. The authors focused on trees, since those . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.