Anytime heuristic for determining agent paths that minimize maximum latency in a sparse DTN
10.1109/ICTAI.2011.139
Saved in:
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Conference or Workshop Item |
Published: |
2013
|
Subjects: | |
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 |
id |
sg-nus-scholar.10635-42125 |
---|---|
record_format |
dspace |
spelling |
sg-nus-scholar.10635-421252023-10-29T20:12:57Z Anytime heuristic for determining agent paths that minimize maximum latency in a sparse DTN Sivakumar, A. Tan, C.K.-Y. COMPUTER SCIENCE Computational geometry Delay tolerant networks Multiagent systems Self-organization 10.1109/ICTAI.2011.139 Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI 882-883 PCTIF 2013-07-04T08:43:58Z 2013-07-04T08:43:58Z 2011 Conference Paper Sivakumar, A., Tan, C.K.-Y. (2011). Anytime heuristic for determining agent paths that minimize maximum latency in a sparse DTN. Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI : 882-883. ScholarBank@NUS Repository. https://doi.org/10.1109/ICTAI.2011.139 9780769545967 10823409 http://scholarbank.nus.edu.sg/handle/10635/42125 000299009900132 Scopus |
institution |
National University of Singapore |
building |
NUS Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NUS Library |
collection |
ScholarBank@NUS |
topic |
Computational geometry Delay tolerant networks Multiagent systems Self-organization |
spellingShingle |
Computational geometry Delay tolerant networks Multiagent systems Self-organization Sivakumar, A. Tan, C.K.-Y. Anytime heuristic for determining agent paths that minimize maximum latency in a sparse DTN |
description |
10.1109/ICTAI.2011.139 |
author2 |
COMPUTER SCIENCE |
author_facet |
COMPUTER SCIENCE Sivakumar, A. Tan, C.K.-Y. |
format |
Conference or Workshop Item |
author |
Sivakumar, A. Tan, C.K.-Y. |
author_sort |
Sivakumar, A. |
title |
Anytime heuristic for determining agent paths that minimize maximum latency in a sparse DTN |
title_short |
Anytime heuristic for determining agent paths that minimize maximum latency in a sparse DTN |
title_full |
Anytime heuristic for determining agent paths that minimize maximum latency in a sparse DTN |
title_fullStr |
Anytime heuristic for determining agent paths that minimize maximum latency in a sparse DTN |
title_full_unstemmed |
Anytime heuristic for determining agent paths that minimize maximum latency in a sparse DTN |
title_sort |
anytime heuristic for determining agent paths that minimize maximum latency in a sparse dtn |
publishDate |
2013 |
url |
http://scholarbank.nus.edu.sg/handle/10635/42125 |
_version_ |
1781411139450568704 |