1 resultado para Election campaigning
em Universidad Politécnica de Madrid
Filtro por publicador
- Repository Napier (1)
- Aberdeen University (1)
- Aberystwyth University Repository - Reino Unido (5)
- Academic Archive On-line (Stockholm University; Sweden) (2)
- Academic Research Repository at Institute of Developing Economies (4)
- Adam Mickiewicz University Repository (3)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (6)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (4)
- Andina Digital - Repositorio UASB-Digital - Universidade Andina Simón Bolívar (1)
- Aquatic Commons (2)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (39)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (5)
- Aston University Research Archive (5)
- Biblioteca Digital da Câmara dos Deputados (6)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (1)
- Biblioteca Digital de la Universidad Católica Argentina (4)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (23)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (22)
- Boston University Digital Common (2)
- Brock University, Canada (20)
- Bucknell University Digital Commons - Pensilvania - USA (5)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- CaltechTHESIS (2)
- CentAUR: Central Archive University of Reading - UK (23)
- Center for Jewish History Digital Collections (20)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (1)
- CiencIPCA - Instituto Politécnico do Cávado e do Ave, Portugal (1)
- Clark Digital Commons--knowledge; creativity; research; and innovation of Clark University (2)
- Cochin University of Science & Technology (CUSAT), India (6)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (9)
- CORA - Cork Open Research Archive - University College Cork - Ireland (2)
- CUNY Academic Works (8)
- Dalarna University College Electronic Archive (2)
- Deakin Research Online - Australia (84)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Archives@Colby (3)
- Digital Commons - Michigan Tech (1)
- Digital Commons - Montana Tech (8)
- Digital Commons @ Winthrop University (2)
- Digital Commons at Florida International University (2)
- DigitalCommons@The Texas Medical Center (1)
- DigitalCommons@University of Nebraska - Lincoln (7)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (4)
- Gallica, Bibliotheque Numerique - Bibliothèque nationale de France (French National Library) (BnF), France (22)
- Greenwich Academic Literature Archive - UK (8)
- Harvard University (1)
- Helda - Digital Repository of University of Helsinki (8)
- Indian Institute of Science - Bangalore - Índia (8)
- Instituto Politécnico do Porto, Portugal (1)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Memoria Académica - FaHCE, UNLP - Argentina (3)
- National Center for Biotechnology Information - NCBI (1)
- Portal de Revistas Científicas Complutenses - Espanha (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (50)
- Queensland University of Technology - ePrints Archive (102)
- RDBU - Repositório Digital da Biblioteca da Unisinos (2)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (3)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (28)
- Repositório Institucional da Universidade de Aveiro - Portugal (2)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (61)
- Research Open Access Repository of the University of East London. (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (6)
- School of Medicine, Washington University, United States (9)
- South Carolina State Documents Depository (4)
- The Scholarly Commons | School of Hotel Administration; Cornell University Research (1)
- Universidad del Rosario, Colombia (37)
- Universidad Politécnica de Madrid (1)
- Universidade de Lisboa - Repositório Aberto (3)
- Universidade Federal do Pará (16)
- Universidade Federal do Rio Grande do Norte (UFRN) (18)
- Universitat de Girona, Spain (6)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (4)
- Université de Lausanne, Switzerland (1)
- Université de Montréal (1)
- Université de Montréal, Canada (25)
- University of Connecticut - USA (1)
- University of Michigan (155)
- University of Queensland eSpace - Australia (10)
- University of Southampton, United Kingdom (2)
- WestminsterResearch - UK (12)
- Worcester Research and Publications - Worcester Research and Publications - UK (1)
Resumo:
In classical distributed systems, each process has a unique identity. Today, new distributed systems have emerged where a unique identity is not always possible to be assigned to each process. For example, in many sensor networks a unique identity is not possible to be included in each device due to its small storage capacity, reduced computational power, or the huge number of devices to be identified. In these cases, we have to work with anonymous distributed systems where processes cannot be identified. Consensus cannot be solved in classical and anonymous asynchronous distributed systems where processes can crash. To bypass this impossibility result, failure detectors are added to these systems. It is known that ? is the weakest failure detector class for solving consensus in classical asynchronous systems when amajority of processes never crashes. Although A? was introduced as an anonymous version of ?, to find the weakest failure detector in anonymous systems to solve consensus when amajority of processes never crashes is nowadays an open question. Furthermore, A? has the important drawback that it is not implementable. Very recently, A? has been introduced as a counterpart of ? for anonymous systems. In this paper, we show that the A? failure detector class is strictly weaker than A? (i.e., A? provides less information about process crashes than A?). We also present in this paper the first implementation of A? (hence, we also show that A? is implementable), and, finally, we include the first implementation of consensus in anonymous asynchronous systems augmented with A? and where a majority of processes does not crash.