Anytime Heuristic for Determining Agent Paths That Minimize Maximum Latency in a Sparse DTN - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Achudhan Sivakumar' in GoogleThis author has not been identified. Look up 'Colin Keng-Yan Tan' in Google

runs on WebDSL