Asynchronous algorithms for approximate distributed constraint optimization with quality bounds

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Christopher Kiekintveld University of Southern California
Zhengyu Yin University of Southern California
Atul Kumar University of Southern California
Milind Tambe University of Southern California
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds 2010 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 14
· Downloads (cumulative): 57
· Citation Count: 10

Published in:
Cover Image
 
· Proceeding
AAMAS '10 Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Pages 133-140
International Foundation for Autonomous Agents and Multiagent Systems Richland, SC ©2010
table of contents ISBN: 978-0-9826571-1-9

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder