Achudhan Sivakumar, Colin Keng-Yan Tan. Anytime Heuristic for Determining Agent Paths That Minimize Maximum Latency in a Sparse DTN. In IEEE 23rd International Conference on Tools with Artificial Intelligence, ICTAI 2011, Boca Raton, FL, USA, November 7-9, 2011. pages 882-883, IEEE, 2011. [doi]
@inproceedings{SivakumarT11,
title = {Anytime Heuristic for Determining Agent Paths That Minimize Maximum Latency in a Sparse DTN},
author = {Achudhan Sivakumar and Colin Keng-Yan Tan},
year = {2011},
doi = {10.1109/ICTAI.2011.139},
url = {http://doi.ieeecomputersociety.org/10.1109/ICTAI.2011.139},
researchr = {https://researchr.org/publication/SivakumarT11},
cites = {0},
citedby = {0},
pages = {882-883},
booktitle = {IEEE 23rd International Conference on Tools with Artificial Intelligence, ICTAI 2011, Boca Raton, FL, USA, November 7-9, 2011},
publisher = {IEEE},
isbn = {978-1-4577-2068-0},
}