A local algorithm for ad hoc majority voting via charge fusion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3274, Issue , 2004, Pages 275-289

  Birk, Yitzhak ^a   Liss, Liran ^a   Schuster, Assaf ^a   Wolff, Ran ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMMUNICATION GRAPHS; INTERCONNECTION TOPOLOGIES; LOCAL ALGORITHM; LOCAL DISTRIBUTED ALGORITHMS; LOCALITY SENSITIVES; MAJORITY VOTE; TIME VARIABLE; VOTING POWER;

FORESTRY;

EID: 35048832519     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30186-8_20     Document Type: Article

References (13)

1. Linial, N.: Locality in distributed graph algorithms. SIAM J. Comp. 21 (1992) 193-201
2. Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Compact distributed data structures for adaptive network routing. Proc. 21st ACM STOC (1989)
3. Kutten, S., Peleg, D.: Fault-local distributed mending. Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing (1995)
4. Kutten, S., Patt-Shamir, B.: Time-adaptive self-stabilization. Proc. of the 16th Annual ACM Symp. on Principles of Distributed Computing (1997) 149-158
5. Birk, Y., Liss, L., Schuster, A., Wolff, R.: A local algorithm for ad hoc majority voting via charge fusion. Technical Report EE1445 (CCIT497), Technion (2004)
6. Wolff, R., Schuster, A.: Association rule mining in peer-to-peer systems. In Proc. of the IEEE Conference on Data Mining (ICDM) (2003)
7. Ford, L., Fulkerson, D. In: Flows in Networks. Princton University Press (1962)
8. Jaffe, J., Moss, F.: A responsive routing algorithm for computer networks. IEEE Transactions on Communications (1982) 1758-1762
9. Garcia-Luna-Aceves, J.: A distributed, loop-free, shortest-path routing algorithm. Proceedings of IEEE INFOCOM (1988) 1125-1137
10. Kaashoek, F., Karger, D.: Koorde: A simple degree-optimal distributed hash table. In Proc. of the Second Intl. Workshop on Peer-to-Peer Systems (IPTPS) (2003)
11. G. Intanagonwiwat, R.G., Estrin, D.: Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proceedings of the Sixth Annual Intl. Conf. on Mobile Computing and Networking (2000)
12. Kempe, D., Dobra, A., Gehrke, J.: Computing aggregate information using gossip. Proceedings of Foundations of Computer Science (FOGS) (2003)
13. Bawa, M., Garcia-Molina, H., Gionis, A., Motwani, R.: Estimating aggregates on a peer-to-peer network. Technical report, Stanford University, DB group (2003)