Výsledky vyhledávání - "Approximate dynamic programming algorithms"

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8

    Zdroj: Computational optimization and applications 38 (2007): 417–443. doi:10.1007/s10589-007-9054-8
    info:cnr-pdr/source/autori:Cristiano Cervellera; Marco Muselli/titolo:Efficient sampling in approximate dynamic programming algorithms/doi:10.1007%2Fs10589-007-9054-8/rivista:Computational optimization and applications/anno:2007/pagina_da:417/pagina_a:443/intervallo_pagine:417–443/volume:38

  9. 9

    Autoři: Zegura, E Anderson, R Subramanian, L a další

    Zdroj: Proceedings of the 1st ACM SIGCAS Conference on Computing and Sustainable Societies (COMPASS 2018)

    URL: https://eprints.qut.edu.au/119550/1/peron%20et%20al%202018%20COMPASS.pdf
    https://eprints.qut.edu.au/119550/1/peron%20et%20al%202018%20COMPASS.pdf
    doi:10.1145/3209811.3209814
    Peron, Martin Brice, Bartlett, Peter, Becker, Kai, Helmstedt, Kate, & Chades, Iadine (2018) Two approximate dynamic programming algorithms for managing complete SIS networks. In Zegura, E, Anderson, R, & Subramanian, L (Eds.) Proceedings of the 1st ACM SIGCAS Conference on Computing and Sustainable Societies (COMPASS 2018). Association for Computing Machinery, United States of America, pp. 1-10.

  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20