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...
Sábháilte in:
| Príomhchruthaitheoir: | |
|---|---|
| Rannpháirtithe: | |
| Formáid: | doctoralThesis |
| Teanga: | pt_BR |
| Foilsithe / Cruthaithe: |
Universidade Federal do Rio Grande do Norte
|
| Ábhair: | |
| Rochtain ar líne: | https://repositorio.ufrn.br/jspui/handle/123456789/29661 |
| Clibeanna: |
Cuir clib leis
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|