Anytime Heuristic for Determining Agent Paths That Minimize Maximum Latency in a Sparse DTN

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.