Anytime heuristic for determining agent paths that minimize maximum latency in a sparse DTN

Anytime heuristic for determining agent paths that minimize maximum latency in a sparse DTN

10.1109/ICTAI.2011.139

Saved in:
Bibliographic Details
Main Authors: Sivakumar, A., Tan, C.K.-Y.
Other Authors: COMPUTER SCIENCE
Format: Conference or Workshop Item
Published: 2013
Subjects:
Computational geometry
Delay tolerant networks
Multiagent systems
Self-organization
Online Access:http://scholarbank.nus.edu.sg/handle/10635/42125
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore

Internet

http://scholarbank.nus.edu.sg/handle/10635/42125

Similar Items