Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"ELECTION PROBLEM"”.

  1. Self-stabilizing leader election in dynamic networks

    The leader election problem is one of the fundamental problems in distributed computing. It has applications in almost every domain. In dynamic networks, topology is expected to change frequently. An algorithm A is self-stabilizing if, starting from a completely arbitrary configuration, the network …

    unlv Repository record for Self-stabilizing leader election in dynamic networks (opens in a new tab) Download PDF for Self-stabilizing leader election in dynamic networks (opens in a new tab)

  2. ΕΚΛΟΓΗ ΑΡΧΗΓΟΥ ΣΕ ΚΑΤΑΝΕΜΗΜΕΝΑ ΣΥΣΤΗΜΑΤΑ

    … COORDINATE THEOTHER PROCESSES OF THE SYSTEM. THE ELECTION PROBLEM AIMS TO DISTINGUISH (ELECT) ONE AMONG THE PROCESSES OF THE SYSTEM AS THE LEADER PROCESS. IN THIS THESIS, IN ORDER TO SOLVE THE ELECTION PROBLEM, IT IS ASSUMED THAT EACH PROCESS HAS A DISTINCT AND UNIQUE IDENTITY VALUE. MOREOVER, THE …

    greece Repository record for ΕΚΛΟΓΗ ΑΡΧΗΓΟΥ ΣΕ ΚΑΤΑΝΕΜΗΜΕΝΑ ΣΥΣΤΗΜΑΤΑ (opens in a new tab)

  3. Three essays on game theory and its applications

    … of public goods, and the second paper studies elections when candidates are asymmetric and voting is costly. Finally, I discusses the equivalence between quasi-perfect equilibrium and sequential equilibria in the last paper. Chapter 1 considers the problem of collective actions. In an …

    unsw Repository record for Three essays on game theory and its applications (opens in a new tab)

  4. Achieving Efficiency, Robustness, and Security in Distributed Computing

    … \emph{message complexity} of the \emph{leader election} problem in diameter-two networks. We first give a simple randomized Monte-Carlo leader election algorithm that with high probability\footnote{Throughout this dissertation, we would use ``eith high probability'' or ``whp'' to mean ``with …

    houston Repository record for Achieving Efficiency, Robustness, and Security in Distributed Computing (opens in a new tab)

  5. Information Infrastructures in Distributed Environments: Algorithms for Mobile Networks and Resource Allocation

    … that communicate with each other to solve some problem. Distributed systems impact almost every aspect of daily life (e.g., cellular networks and the Internet); however, it is hard to develop services on top of distributed systems due to the unreliable nature of computing entities and …

    tamu Repository record for Information Infrastructures in Distributed Environments: Algorithms for Mobile Networks and Resource Allocation (opens in a new tab)