Abstract | ||
---|---|---|
We revisit the Whittle index policy for scheduling web crawlers for ephemeral content proposed in Avrachenkov and Borkar, IEEE Trans. Control of Network Systems 5(1), 2016, and develop a reinforcement learning scheme for it based on LSPE(0). The scheme leverages the known structural properties of the Whittle index policy. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1109/ALLERTON.2019.8919743 | 2019 57TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON) |
Field | DocType | ISSN |
Computer science,Scheduling (computing),Processor scheduling,Web crawler,Reinforcement learning,Distributed computing | Conference | 2474-0195 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Konstantin Avrachenkov | 1 | 1250 | 126.17 |
Vivek S. Borkar | 2 | 974 | 142.14 |