Sciweavers

22 search results - page 1 / 5
» Optimal Elections in Faulty Loop Networks and Applications
Sort
View
TC
1998
13 years 4 months ago
Optimal Elections in Faulty Loop Networks and Applications
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
Bernard Mans, Nicola Santoro
TDSC
2011
12 years 11 months ago
Mechanism Design-Based Secure Leader Election Model for Intrusion Detection in MANET
—In this paper, we study leader election in the presence of selfish nodes for intrusion detection in mobile ad hoc networks (MANETs). To balance the resource consumption among a...
Noman Mohammed, Hadi Otrok, Lingyu Wang, Mourad De...
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
13 years 9 months ago
Evolving distributed algorithms with genetic programming: election
In this paper, we present a detailed analysis of the application of Genetic Programming to the evolution of distributed algorithms. This research field has many facets which make...
Thomas Weise, Michael Zapf
IEEEPACT
2007
IEEE
13 years 11 months ago
Performance Portable Optimizations for Loops Containing Communication Operations
Effective use of communication networks is critical to the performance and scalability of parallel applications. Partitioned Global Address Space languages like UPC bring the pro...
Costin Iancu, Wei Chen, Katherine A. Yelick
DCOSS
2005
Springer
13 years 10 months ago
Design and Comparison of Lightweight Group Management Strategies in EnviroSuite
Tracking is one of the major applications of wireless sensor networks. EnviroSuite, as a programming paradigm, provides a comprehensive solution for programming tracking applicatio...
Liqian Luo, Tarek F. Abdelzaher, Tian He, John A. ...