Small world model for agent search

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Small world model for agent search

Full text

Pdf (212 KB)

Source

International Conference on Autonomous Agents archive
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 table of contents

Budapest, Hungary

SESSION: Environments table of contents

Pages 1177-1178

Year of Publication: 2009

ISBN:978-0-9817381-7-8

Author

Miguel Rebollo

Universidad Politécnica de Valencia, Valencia, Spain

Sponsors

: The Foundation for Intelligent Physical Agents
Microsoft Research : Microsoft Research
: Whitestein Technologies
: European Office of Aerospace Research and Development, Air Force Office of Scientific Research, United States Air Force Research Laboratory
: Drexel University
: Wiley -- Blackwell Ltd

Publisher

International Foundation for Autonomous Agents and Multiagent Systems Richland, SC

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 18, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

ABSTRACT

This paper shows how to apply an small world model to distribute AMS and DF services, forming a navigable small world network that allow to find short paths between agents using a greedy algorithm that takes into account only local information.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286:509--512, 1999.
	2	B. Bollobás and W. F. de la Vega. The diameter of random regular graphs. Combinatorica, 2:125--134, 1982.
	3	Jon Kleinberg, The small-world phenomenon: an algorithm perspective, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.163-170, May 21-23, 2000, Portland, Oregon, United States [doi>10.1145/335305.335325]
	4	S. Milgram. The small world problem. Pyshol. Today, 2:60--67, 1967.
	5	D. Watts. Six Degrees. The Science of a Connected Age. W. W. Norton&Company, New York, 2003.