Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Permanents Faults"'
Publikováno v:
ACM Transactions on Algorithms
ACM Transactions on Algorithms, Association for Computing Machinery, 2021, Leibniz International Proceedings in Informatics (LIPIcs), pp.1-32. ⟨10.1145/3448305⟩
ACM Transactions on Algorithms, 2021, Leibniz International Proceedings in Informatics (LIPIcs), pp.1-32. ⟨10.1145/3448305⟩
ACM Transactions on Algorithms, Association for Computing Machinery, 2021, Leibniz International Proceedings in Informatics (LIPIcs), pp.1-32. ⟨10.1145/3448305⟩
ACM Transactions on Algorithms, 2021, Leibniz International Proceedings in Informatics (LIPIcs), pp.1-32. ⟨10.1145/3448305⟩
We consider a search problem on trees in which an agent starts at the root of a tree and aims to locate an adversarially placed treasure, by moving along the edges, while relying on local, partial information. Specifically, each node in the tree hold
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9279a813e37baa58751bc4b174c0e743
https://hal.archives-ouvertes.fr/hal-01958133v2/document
https://hal.archives-ouvertes.fr/hal-01958133v2/document
Publikováno v:
26th Annual European Symposium on Algorithms (ESA 2018)
ESA 2018-26th Annual European Symposium on Algorithms
ESA 2018-26th Annual European Symposium on Algorithms, Aug 2018, Helsinki, Finland. pp.1-32, ⟨10.4230/LIPIcs.ESA.2018.54⟩
ESA 2018-26th Annual European Symposium on Algorithms
ESA 2018-26th Annual European Symposium on Algorithms, Aug 2018, Helsinki, Finland. pp.1-32, ⟨10.4230/LIPIcs.ESA.2018.54⟩
We consider a search problem on trees using unreliable guiding instructions. Specifically, an agent starts a search at the root of a tree aiming to find a treasure hidden at one of the nodes by an adversary. Each visited node holds information, calle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab45ee804e30d40750559cb9c207267e
https://hal.archives-ouvertes.fr/hal-01958133
https://hal.archives-ouvertes.fr/hal-01958133