Gotowa bibliografia na temat „Algorithme du Consensus”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Algorithme du Consensus”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Algorithme du Consensus"
Fermon, Cécile, François-Jérôme Authier i Laure Gallay. "Les myosites à éosinophiles idiopathiques". Les Cahiers de Myologie, nr 25 (lipiec 2022): 6–9. http://dx.doi.org/10.1051/myolog/202225003.
Pełny tekst źródłaWaardenberg, Ashley J., i Matthew A. Field. "consensusDE: an R package for assessing consensus of multiple RNA-seq algorithms with RUV correction". PeerJ 7 (13.12.2019): e8206. http://dx.doi.org/10.7717/peerj.8206.
Pełny tekst źródłaXiong, Huanliang, Muxi Chen, Canghai Wu, Yingding Zhao i Wenlong Yi. "Research on Progress of Blockchain Consensus Algorithm: A Review on Recent Progress of Blockchain Consensus Algorithms". Future Internet 14, nr 2 (30.01.2022): 47. http://dx.doi.org/10.3390/fi14020047.
Pełny tekst źródłaZhong, Weiyu, Ce Yang, Wei Liang, Jiahong Cai, Lin Chen, Jing Liao i Naixue Xiong. "Byzantine Fault-Tolerant Consensus Algorithms: A Survey". Electronics 12, nr 18 (8.09.2023): 3801. http://dx.doi.org/10.3390/electronics12183801.
Pełny tekst źródłaGe, Lina, Jie Wang i Guifen Zhang. "Survey of Consensus Algorithms for Proof of Stake in Blockchain". Security and Communication Networks 2022 (29.05.2022): 1–13. http://dx.doi.org/10.1155/2022/2812526.
Pełny tekst źródłaPalomares, A., M. Rebollo i C. Carrascosa. "Supportive consensus". PLOS ONE 15, nr 12 (17.12.2020): e0243215. http://dx.doi.org/10.1371/journal.pone.0243215.
Pełny tekst źródłaAcharya, Deep Shekhar, i Sudhansu Kumar Mishra. "Optimal Consensus Recovery of Multi-agent System Subjected to Agent Failure". International Journal on Artificial Intelligence Tools 29, nr 06 (wrzesień 2020): 2050017. http://dx.doi.org/10.1142/s0218213020500177.
Pełny tekst źródłaBakhvalova, Ekaterina Alexandrovna, i Vladimir Anatolievich Sudakov. "Research of consensus algorithms for blockchain platforms". Keldysh Institute Preprints, nr 26 (2021): 1–16. http://dx.doi.org/10.20948/prepr-2021-26.
Pełny tekst źródłaHanna, Fouad, Lionel Droz-Bartholet i Jean-Christophe Lapayre. "Toward a Faster Fault Tolerant Consensus to Maintain Data Consistency in Collaborative Environments". International Journal of Cooperative Information Systems 26, nr 03 (14.08.2017): 1750002. http://dx.doi.org/10.1142/s0218843017500022.
Pełny tekst źródłaKhan, Dr Kashif Mehboob, Muhammad Abdullah Hayat i Rana Muhammad Ibrahim. "Investigating the Impact of Consensus Algorithm on Scalability in Blockchain Systems". Sir Syed University Research Journal of Engineering & Technology 12, nr 2 (25.12.2022): 01–06. http://dx.doi.org/10.33317/ssurj.427.
Pełny tekst źródłaRozprawy doktorskie na temat "Algorithme du Consensus"
Lavault, Christian. "Algorithmique et complexité distribuées : applications à quelques problèmes fondamentaux de complexité, protocoles distribués à consensus, information globale, problèmes distribués d'élection et de routage". Paris 11, 1987. http://www.theses.fr/1987PA112392.
Pełny tekst źródłaHanna, Fouad. "Etude et développement du nouvel algorithme distribué de consensus FLC permfettant de maintenir la cohérence des données partagées et tolérant aux fautess". Thesis, Besançon, 2016. http://www.theses.fr/2016BESA2051.
Pełny tekst źródłaNowadays, collaborative work took a very important place in many fields and particularly in the medicaltelediagnosis field. The consistency of shared data is a key issue in this type of applications. Moreover, itis essential to use a consensus algorithm to ensure data consistency in collaborative platforms. We presenthere our new consensus algorithm FLC that helps to ensure data consistency in asynchronous collaborativedistributed systems. Our algorithm is fault tolerant and aims to improve the performance of consensus ingeneral and particularly in the case of process crashes. The new algorithm uses the leader oracle tocircumvent the impossibility result of the FLP theorem. It is decentralized and considers the crash-stop failuremodel. The FLC algorithm is based on two main ideas. The first is to perform, at the beginning of eachround, a simple election phase guaranteeing the existence of only one leader per round. The second is totake advantage of system stability and more particularly of the fact that the leader does not crash betweentwo consecutive consensus runs. The performance of our algorithm was analyzed and compared to the mostknown algorithms in the domain. The results obtained by simulation, using the Neko platform, demonstratedthat our algorithm gave the best performance when using a multicast network in the best case scenario and insituations where the algorithm undergoes one or more crashes of coordinators/leaders processes
Ouattara, Mory. "Développement et mise en place d'une méthode de classification multi-blocs : application aux données de l'OQAI". Phd thesis, Conservatoire national des arts et metiers - CNAM, 2014. http://tel.archives-ouvertes.fr/tel-01062782.
Pełny tekst źródłaKyrgyzov, Ivan. "Recherche dans les bases de donnees satellitaires des paysages et application au milieu urbain: clustering, consensus et categorisation". Phd thesis, Télécom ParisTech, 2008. http://pastel.archives-ouvertes.fr/pastel-00004084.
Pełny tekst źródłaBelkadi, Adel. "Conception de commande tolérante aux défauts pour les systèmes multi-agents : application au vol en formation d'une flotte de véhicules autonomes aériens". Thesis, Université de Lorraine, 2017. http://www.theses.fr/2017LORR0183/document.
Pełny tekst źródłaIn recent years, the emergence of new technologies such as miniaturization of components, wireless communication devices, increased storage size and computing capabilities have allowed the design of increasingly complex cooperative multi-agent systems. One of the main research axes in this topic concerns the formation control of fleets of autonomous vehicles. Many applications and missions, civilian and military, such as exploration, surveillance, and maintenance, were developed and carried out in various environments. During the execution of these tasks, the vehicles must interact with their environment and among themselves to coordinate. The available communication tools are often limited in scope. The preservation of the connection within the group then becomes one of the objectives to be satisfied in order to carry out the task successfully. One of the possibilities to guarantee this constraint is the training displacement, which makes it possible to preserve the distances and the geometrical structure of the group. However, it is necessary to have tools and methods for analyzing and controlling these types of systems in order to make the most of their potential. This thesis is part of this research direction by presenting a synthesis and analysis of multi-agent dynamical systems and more particularly the formation control of autonomous vehicles. The control laws developed in the literature for formation control allow to carry out a large number of missions with a high level of performance. However, if a fault/failure occurs in the training, these control laws can be very limited, resulting in unstable system behavior. The development of fault tolerant controls becomes paramount to maintaining control performance in the presence of faults. This problem will be dealt with in more detail in this thesis and will concern the development and design of Fault tolerant controls devolved to a fleet of autonomous vehicles according to different configuration/structuring
Ouattara, Mory. "Développement et mise en place d'une méthode de classification multi-blocs : application aux données de l'OQAI". Electronic Thesis or Diss., Paris, CNAM, 2014. http://www.theses.fr/2014CNAM0914.
Pełny tekst źródłaThe multiplication of information source and the development of news technologies generates complex databases, often characterized by relatively high number of variables compared to individuals. In particular, in the environmental studies on the indoor air quality, the information's collection is done according to several thematic, yielding column partitioned or multi-block data set. However, in case of high dimensional data, classical clustering algorithms are not efficient to find clusters which may exist in subspaces of the original space. The goal of this work is to develop clustering algorithms adapted to high dimensional data sets with multi-block structure. The first part of the work shows the state of art on clustering methods. In the second part, three new methods of clustering: the subspace clustering method 2S-SOM (Soft Subspace-Self Organizing Map)is based on a modified cost function of the Self Organizing Maps method across a double system of weights on the blocks and the variables. Then we propose two approaches to find the consensus of self-organized maps CSOM (Consensus SOM) and Rv-CSOM based on weights determined from initial partitions. The last part presents an application of these methods on the OQAI data to determine a typology of dwellings relatively to the following topics: indoor air quality, dwellings structure, household characteristics and habits of the inhabitants
van, de Hoef Sebastian. "Extended Consensus Algorithms". Thesis, KTH, Reglerteknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-125809.
Pełny tekst źródłaDANCKAERT, PERRUCHOT ANNE. "Traitement informatique des autoradiographies de gels de sequences : conception et mise en oeuvre d'un systeme automatique d'interpretation d'autoradiographies, elaboration d'un algorithme de construction de la sequence consensus a partir de fragments". Paris 7, 1988. http://www.theses.fr/1988PA077045.
Pełny tekst źródłaCórdova, Morales David Alexis. "Blockchain Application for Mesh and Mobile Ad Hoc Networks". Electronic Thesis or Diss., Sorbonne université, 2022. https://theses.hal.science/tel-03922843.
Pełny tekst źródłaBlockchain is a technology that maintains a single record of information in a decentralized and distributed manner while ensuring data security. This technology, which is behind the most popular cryptocurrency, Bitcoin, is changing the way we think about information records in distributed systems. Indeed, the cryptographic feature set and the distributed nature of the technology make blockchain one of the most secure tools available today for maintaining a record of information. The first applications to have adopted this technology are in the field of finance, where it is now possible to carry out transactions directly between users without going through a central authority. However, other fields have also shown interest in this technology, such as medicine, for the secure sharing of medical records; art and music, for the tracking of copyrights and royalties; governance, for secure voting, IoT, etc. However, to benefit from such technology it is necessary to count with high reliability and connectivity, as provided by the Internet. In mesh and mobile ad hoc networks, it is often necessary to deploy its own infrastructure and services where the infrastructure of operators are not available due to the geography of the site or to an exceptional situation as is the case of natural disasters, war zones or monitoring of protected areas to achieve specific missions. The dynamism of these networks makes it difficult to use a blockchain to maintain a record of information. Indeed, the mobility of nodes can cause partitions in the network that may or may not be desired; nodes can appear and disappear, partitions can split or reunite depending on the mobility of the nodes. This poses a problem for a traditional blockchain, as partitions in the network lead to forks (competing chains) that are often resolved by choosing the longest chain and ignoring other competing chains. For the use cases of mesh and mobile ad hoc networks that we seek to solve, the concurrent chains constructed by the effect of network partitions can be considered as legitimate chains carrying information related to a given network partition. It is therefore important to include these chains in the information register. In this thesis manuscript, we propose the Blockgraph, a blockchain-like technology capable of dealing with network partitions for mobile mesh and ad hoc networks. The Blockgraph, takes the form of a direct acyclic graph based on node mobility and inherits all the security properties of the blockchain. In addition, we propose C4M, a RAFT-based consensus algorithm that has been adapted to work with the Blockgraph and is also tolerant to network partitions. To validate our solutions, we first implemented the Blockgraph and C4M in the discrete event simulator, NS-3. We performed a first performance study of each system, then we implemented the Blockgraph in real proof-of-concept mesh routers to validate the effectiveness of our solution. Finally, we performed a performance study and presented our conclusions
Bechihi, Adel. "Joint design of control algorithms and communication protocols for Connected and Automated Vehicles". Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPAST203.
Pełny tekst źródłaIn this thesis, we address the problem of control of multi-agent systems connected over realistic models of communication systems. We mainly focus on systems of connected and automated vehicles (CAVs) that communicate through a 5G communication system, which allows two types of communication: direct communication between nodes, known as Vehicle-to-Vehicle (V2V) communications, and communication through the network infrastructure, which is the traditional way of communication in cellular networks.The thesis discusses three problems: first, we analyze the stability and convergence properties of the consensus algorithm of first-order integrator agents using a time-division multiple access (TDMA) scheme to share the network resources of a broadcast shared communication channel. Exponential stability of the considered system is proved, and an explicit bound depending on the communication system parameters is provided to estimate the convergence rate. Second, we treat the problem of formation control of a float of connected vehicles in a 5G communication context. We propose a resource allocation algorithm to select the transmitting users to achieve the desired formation while satisfying the constraints imposed by the communication system. Finally, we study the stability properties of Kalman filters for hybrid systems, i.e., systems with continuous-time dynamics observed through discrete-time measurements. Input-to-state stability (ISS) is proved for such systems relying on an appropriate Lyapunov function. This result can be considered as a first step in the robustness analysis of the overall system since it allows to treat the effects of communication errors on the controlled system stability
Książki na temat "Algorithme du Consensus"
W, Beard Randal, red. Distributed consensus in multi-vehicle cooperative control: Theory and applications. London: Springer, 2008.
Znajdź pełny tekst źródłaSemsar-Kazerooni, Elham. Team Cooperation in a Network of Multi-Vehicle Unmanned Systems: Synthesis of Consensus Algorithms. New York, NY: Springer New York, 2013.
Znajdź pełny tekst źródłaSuter, David, Gerard Medioni, Sven Dickinson i Tat-Jun Chin. Maximum Consensus Problem: Recent Algorithmic Advances. Morgan & Claypool Publishers, 2017.
Znajdź pełny tekst źródłaSuter, David, Gerard Medioni, Sven Dickinson i Tat-Jun Chin. Maximum Consensus Problem: Recent Algorithmic Advances. Morgan & Claypool Publishers, 2017.
Znajdź pełny tekst źródłaSuter, David, i Tat-Jun Chin. Maximum Consensus Problem: Recent Algorithmic Advances. Springer International Publishing AG, 2017.
Znajdź pełny tekst źródłaVukolic, Marko. Quorum Systems: With Applications to Storage and Consensus. Morgan & Claypool Publishers, 2012.
Znajdź pełny tekst źródłaVukolic, Marko. Quorum Systems: With Applications to Storage and Consensus. Morgan & Claypool Publishers, 2012.
Znajdź pełny tekst źródłaVukolic, Marko. Quorum Systems: With Applications to Storage and Consensus. Springer International Publishing AG, 2012.
Znajdź pełny tekst źródłaBeard, Randal, i Wei Ren. Distributed Consensus in Multi-Vehicle Cooperative Control: Theory and Applications. Springer London, Limited, 2010.
Znajdź pełny tekst źródłaTeam Cooperation In A Network Of Multivehicle Unmanned Systems Synthesis Of Consensus Algorithms. Springer, 2012.
Znajdź pełny tekst źródłaCzęści książek na temat "Algorithme du Consensus"
Tekriwal, Mohit, Avi Tachna-Fram, Jean-Baptiste Jeannin, Manos Kapritsos i Dimitra Panagou. "Formally verified asymptotic consensus in robust networks". W Tools and Algorithms for the Construction and Analysis of Systems, 248–67. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57246-3_14.
Pełny tekst źródłaBhardwaj, Rashmi, i Debabrata Datta. "Consensus Algorithm". W Studies in Big Data, 91–107. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-38677-1_5.
Pełny tekst źródłaDe La Cruz, Livio, Stephen Kobourov, Sergey Pupyrev, Paul S. Shen i Sankar Veeramoni. "Computing Consensus Curves". W Experimental Algorithms, 223–34. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07959-2_19.
Pełny tekst źródłaChin, Tat-Jun, i David Suter. "Exact Algorithms". W The Maximum Consensus Problem, 81–126. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-031-01818-3_3.
Pełny tekst źródłaChin, Tat-Jun, i David Suter. "Approximate Algorithms". W The Maximum Consensus Problem, 21–79. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-031-01818-3_2.
Pełny tekst źródłaHerlihy, Maurice. "Asynchronous Consensus Impossibility". W Encyclopedia of Algorithms, 152–55. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_36.
Pełny tekst źródłaHerlihy, Maurice. "Asynchronous Consensus Impossibility". W Encyclopedia of Algorithms, 70–73. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_36.
Pełny tekst źródłaKao, Ming-Yang. "Wait-Free Consensus". W Encyclopedia of Algorithms, 1015. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_468.
Pełny tekst źródłaRehmani, Mubashir Husain. "Blockchain Consensus Algorithms". W Blockchain Systems and Communication Networks: From Concepts to Implementation, 61–78. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71788-9_4.
Pełny tekst źródłaRaynal, Michel. "Consensus Numbers and the Consensus Hierarchy". W Concurrent Programming: Algorithms, Principles, and Foundations, 421–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32027-9_16.
Pełny tekst źródłaStreszczenia konferencji na temat "Algorithme du Consensus"
Bogdanov, A., V. Korkhov, N. Shchegoleva, V. Khvatov, N. Zaynalov, J. Kiyamov, A. Dik i A. Faradzhov. "COMPARATIVE ANALYSIS AND APPLICABILITY DETERMINATION FOR SEVERAL DLT SOLUTIONS". W 9th International Conference "Distributed Computing and Grid Technologies in Science and Education". Crossref, 2021. http://dx.doi.org/10.54546/mlit.2021.13.56.001.
Pełny tekst źródłaLunardi, Roben Castagna, i Avelino Francisco Zorzo. "Multi-level consensus algorithm for appendable-block blockchains in IoT Environments". W Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/sbseg_estendido.2022.224706.
Pełny tekst źródłaGolab, Wojciech. "The Recoverable Consensus Hierarchy". W SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3350755.3400212.
Pełny tekst źródłaZhang, Xiaojun, Weiyu Zhong, Ce Yang, Lin Chen, Jing Liao i Naixue Xiong. "BFT Consensus Algorithms". W 2023 IEEE 10th International Conference on Cyber Security and Cloud Computing (CSCloud)/2023 IEEE 9th International Conference on Edge Computing and Scalable Cloud (EdgeCom). IEEE, 2023. http://dx.doi.org/10.1109/cscloud-edgecom58631.2023.00080.
Pełny tekst źródłaMahamuni, Dipti. "A Comparative Framework for Evaluating Consensus Algorithms for Blockchains". W 2nd International Conference on Machine Learning Techniques and NLP (MLNLP 2021). Academy and Industry Research Collaboration Center (AIRCC), 2021. http://dx.doi.org/10.5121/csit.2021.111411.
Pełny tekst źródłaBassolillo, S. "Target localization with a distributed Kalman filter over a network of UAVs". W Aeronautics and Astronautics. Materials Research Forum LLC, 2023. http://dx.doi.org/10.21741/9781644902813-21.
Pełny tekst źródłaAfshari, Sina, i Sandipan Mishra. "Decentralized Feedback Control of Smart Lighting Systems". W ASME 2013 Dynamic Systems and Control Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/dscc2013-3968.
Pełny tekst źródłaBecchetti, Luca, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri i Luca Trevisan. "Simple dynamics for plurality consensus". W SPAA '14: 26th ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2612669.2612677.
Pełny tekst źródłaBecchetti, L., A. Clementi, E. Natale, F. Pasquale i L. Trevisan. "Stabilizing Consensus with Many Opinions". W Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2015. http://dx.doi.org/10.1137/1.9781611974331.ch46.
Pełny tekst źródłaJansson, Jesper, Chuanqi Shen i Wing-Kin Sung. "Improved Algorithms for Constructing Consensus Trees". W Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611973105.129.
Pełny tekst źródłaRaporty organizacyjne na temat "Algorithme du Consensus"
Liang, Guanfeng, i Nitin Vaidya. Deterministic Consensus Algorithm with Linear Per-Bit Complexity. Fort Belvoir, VA: Defense Technical Information Center, sierpień 2010. http://dx.doi.org/10.21236/ada555082.
Pełny tekst źródłaFox, A., C. Ponce, A. Applegate, M. Nygaard i N. Duan. Comparison of Distributive Consensus Algorithms for AnomalyDetection on the Power-Grid. Office of Scientific and Technical Information (OSTI), listopad 2018. http://dx.doi.org/10.2172/1490934.
Pełny tekst źródłaMatei, Ion, Christoforos Somarakis i John S. Baras. A Randomized Gossip Consenus Algorithm on Convex Metric Spaces. Fort Belvoir, VA: Defense Technical Information Center, styczeń 2012. http://dx.doi.org/10.21236/ada588967.
Pełny tekst źródłaAllende López, Marcos, Diego López, Sergio Cerón, Antonio Leal, Adrián Pareja, Marcelo Da Silva, Alejandro Pardo i in. Quantum-Resistance in Blockchain Networks. Inter-American Development Bank, czerwiec 2021. http://dx.doi.org/10.18235/0003313.
Pełny tekst źródłaDominguez-Garcia, Alejandro D., Christoforos N. Hadjicostis i Nitin H. Vaidya. Distributed Algorithms for Consensus and Coordination in the Presence of Packet-Dropping Communication Links. Part 1: Statistical Moments Analysis Approach. Fort Belvoir, VA: Defense Technical Information Center, wrzesień 2011. http://dx.doi.org/10.21236/ada558911.
Pełny tekst źródłaAnderson, Gerald L., i Kalman Peleg. Precision Cropping by Remotely Sensed Prorotype Plots and Calibration in the Complex Domain. United States Department of Agriculture, grudzień 2002. http://dx.doi.org/10.32747/2002.7585193.bard.
Pełny tekst źródłaDaudelin, Francois, Lina Taing, Lucy Chen, Claudia Abreu Lopes, Adeniyi Francis Fagbamigbe i Hamid Mehmood. Mapping WASH-related disease risk: A review of risk concepts and methods. United Nations University Institute for Water, Environment and Health, grudzień 2021. http://dx.doi.org/10.53328/uxuo4751.
Pełny tekst źródła