Aprendizagem por reforço profundo uma nova perspectiva sobre o problema dos k-servos
The k-server problem in a weighted graph (or metric space) is defined by the need to efficiently move k servers to fulfill a sequence of requests that arise online at each graph node. This is perhaps the most influential online computation problem whose solution remains open, serving as an abstra...
Bewaard in:
| Hoofdauteur: | |
|---|---|
| Andere auteurs: | |
| Formaat: | doctoralThesis |
| Taal: | pt_BR |
| Gepubliceerd in: |
Universidade Federal do Rio Grande do Norte
|
| Onderwerpen: | |
| Online toegang: | https://repositorio.ufrn.br/jspui/handle/123456789/29661 |
| Tags: |
Voeg label toe
Geen labels, Wees de eerste die dit record labelt!
|