"Anytime Heuristic for Determining Agent Paths That Minimize Maximum ..."

Achudhan Sivakumar, Colin Keng-Yan Tan (2011)

> Home

Details and statistics

DOI: 10.1109/ICTAI.2011.139

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/ictai/SivakumarT11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ictai/SivakumarT11
Achudhan Sivakumar, Colin Keng-Yan Tan:
Anytime Heuristic for Determining Agent Paths That Minimize Maximum Latency in a Sparse DTN. ICTAI 2011: 882-883

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.