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...
Zapisane w:
| 1. autor: | |
|---|---|
| Kolejni autorzy: | |
| Format: | doctoralThesis |
| Język: | pt_BR |
| Wydane: |
Universidade Federal do Rio Grande do Norte
|
| Hasła przedmiotowe: | |
| Dostęp online: | https://repositorio.ufrn.br/jspui/handle/123456789/29661 |
| Etykiety: |
Dodaj etykietę
Nie ma etykietki, Dołącz pierwszą etykiete!
|