Conference paper · 2006
A distributed stand-in agent based algorithm for opportunistic resource allocation
ACM Symposium on Applied Computing, 119–125 · Published 23 April 2006 · DOI 10.1145/1141277.1141303
In brief
“A distributed stand-in agent based algorithm for opportunistic resource allocation” is a 2006 conference paper by Petr Benda and 4 co-authors, published in ACM Symposium on Applied Computing. OpenAlex counts 0 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 0
- References
- 13
- Authors
- 5
Abstract
Mobile ad-hoc networks (MANET) are expected to form the basis of future mission critical applications such as combat and rescue operations. In this context, communication and computational tasks required by overlying applications will rely on the combined capabilities and resources provided by the underlying network nodes. This paper introduces an integrated FlexFeed/Aglobe technology and distributed… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Benda, P., Jisl, P., Pěchouček, M., Suri, N., & Carvalho, M. (2006). A distributed stand-in agent based algorithm for opportunistic resource allocation. ACM Symposium on Applied Computing, 119–125. https://doi.org/10.1145/1141277.1141303
MLA 9
Benda, Petr, et al. “A distributed stand-in agent based algorithm for opportunistic resource allocation.” ACM Symposium on Applied Computing, 2006, pp. 119–125. https://doi.org/10.1145/1141277.1141303.
Chicago
Benda, Petr, Pavel Jisl, Michal Pěchouček, Niranjan Suri, and Marco Carvalho. 2006. “A distributed stand-in agent based algorithm for opportunistic resource allocation.” ACM Symposium on Applied Computing: 119–125. https://doi.org/10.1145/1141277.1141303.
Harvard
Benda, P. et al. (2006) ‘A distributed stand-in agent based algorithm for opportunistic resource allocation’, ACM Symposium on Applied Computing, pp. 119–125. doi:10.1145/1141277.1141303.
IEEE
P. Benda, P. Jisl, M. Pěchouček, N. Suri, and M. Carvalho, “A distributed stand-in agent based algorithm for opportunistic resource allocation,” ACM Symposium on Applied Computing, pp. 119–125, 2006, doi: 10.1145/1141277.1141303.
BibTeX
@inproceedings{benda2006distributed,
title = {{A distributed stand-in agent based algorithm for opportunistic resource allocation}},
author = {Benda, Petr and Jisl, Pavel and Pěchouček, Michal and Suri, Niranjan and Carvalho, Marco},
booktitle = {ACM Symposium on Applied Computing},
year = {2006},
pages = {119--125},
doi = {10.1145/1141277.1141303},
url = {https://doi.org/10.1145/1141277.1141303}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Ad Hoc Networks
- mobile ad hoc networks
- automated negotiation
- resource reservation
- remote presence
- distributed coordination
- mission-critical applications
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Benda, P., Jisl, P., Pěchouček, M., Suri, N., & Carvalho, M. (2006). A distributed stand-in agent based algorithm for opportunistic resource allocation. ACM Symposium on Applied Computing, 119–125. https://doi.org/10.1145/1141277.1141303
How many times has this paper been cited?
0 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Petr Benda, Pavel Jisl, Michal Pěchouček, Niranjan Suri, Marco Carvalho.
What is the DOI of this paper?
10.1145/1141277.1141303, permanently at https://doi.org/10.1145/1141277.1141303. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.