Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Harsh Deshpande"'
Publikováno v:
2021 National Conference on Communications (NCC).
We consider a system with a sensor tracking a time-varying quantity and sending updates to a monitoring station using one of $K$ different data-rates for each update. The probability of an attempted update is an unknown function of the data-rate of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f71a8b62615396010554f7c8ff8f713
https://doi.org/10.1109/ncc52529.2021.9530103
https://doi.org/10.1109/ncc52529.2021.9530103
Publikováno v:
AAAI
Navigating a collection of documents can be facilitated by obtaining a human-understandable concept hierarchy with links to the content. This is a non-trivial task for two reasons. First, defining concepts that are understandable by an average consum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13ed725f0c9f867febd71f4b92bb5c15
https://doi.org/10.1609/aaai.v34i09.7103
https://doi.org/10.1609/aaai.v34i09.7103
Publikováno v:
COMSNETS
Contextual bandits have the same exploration-exploitation trade-off as standard multi-armed bandits. On adding positive externalities that decay with time, this problem becomes much more difficult as wrong decisions at the start are hard to recover f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ca4f869e578e91e8310a23f47d64b7d
https://doi.org/10.1109/comsnets48256.2020.9027425
https://doi.org/10.1109/comsnets48256.2020.9027425