By Topic

Revisiting ADOPT-ing and its Feedback Schemes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Silaghi, M.C. ; Florida Inst. of Technol., Melbourne ; Yokoo, M.

Here we revisit ADOPT-ing and bring two new contributions. One contribution consists of developing variations on the algorithms keeping the improvement in length of chain of causal messages without an increase in the total number of messages. While past experiments have shown that sending more feedback is better than sending the minimal information needed for correctness, new experiments show that one should not exaggerate sending too much feedback and that the best strategy is at an intermediary point. This brings large efficiency improvements. We also find that one of the no good storages of ADOPT- ing can be removed without effects on efficiency while decreasing the space complexity by a factor given by the number of agents. We also provide a more general proof showing which types of nogood storages can be used in the inference of feedback without compromising correctness. In particular we show that all such structures can be updated by sum-inference, and from threshold messages.

Published in:

Intelligent Agent Technology, 2007. IAT '07. IEEE/WIC/ACM International Conference on

Date of Conference:

2-5 Nov. 2007