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...
Сохранить в:
| Главный автор: | |
|---|---|
| Другие авторы: | |
| Формат: | doctoralThesis |
| Язык: | pt_BR |
| Опубликовано: |
Universidade Federal do Rio Grande do Norte
|
| Предметы: | |
| Online-ссылка: | https://repositorio.ufrn.br/jspui/handle/123456789/29661 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|