By Topic

A new look at egocentric algorithms

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)
Azadmanesh, A.H. ; Dept. of Comput. Sci., Nebraska Univ., Omaha, NE, USA ; Sharif, H.

With respect to approximate agreement, some categories of voting algorithms have been developed. This research presents an approach to one family of algorithms called egocentric algorithms, and analyzes the conditions under which the approach performs better than the existing egocentric voting algorithms. In addition, the approach provides some insight into the voting process of such algorithms.

Published in:

Parallel and Distributed Systems, 2004. ICPADS 2004. Proceedings. Tenth International Conference on

Date of Conference:

7-9 July 2004