20 results for “consensus algorithms”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
Convergence time of 3-Majority and 2-Choices dynamics on complete graph in synchronous model
Jing-Zhe Xu, Zhi-Wei Liu, Ming-Feng Ge, Yan-Wu Wang +1 more
A new algorithm is developed for distributed optimization in networked nonlinear systems with input delays and consensus constraints.
This paper introduces the Organizational Consensus Algorithm (OCA) for internal negotiation and decision coordination in organizational structures, modeling inter-departmental conflict as a dynamic ga…
The authors resolve the contradiction between deterministic crash-tolerant consensus in a fully asynchronous environment and the FLP impossibility result by demonstrating that one protocol phase separ…
This paper introduces a new distributed computational model called the uniform port model, which allows for efficient self-stabilizing algorithms for local symmetry breaking problems on general graphs…
This paper investigates how time-varying interactions impact the robustness of multi-agent dynamics in both continuous- and discrete-time settings.
Proposed an asynchronous block coordinate descent algorithm for distributed trajectory estimation in robotics, reducing communications by up to 96.9% and achieving exponential convergence.
The paper proposes using an LLM aggregator that analyzes complete reasoning traces, demonstrating that trace-level synthesis is superior to traditional consensus methods like majority voting for solvi…
This paper proposes a decentralized collaborative learning paradigm for Tsetlin Machines using consensus-based inference, allowing heterogeneous agents to maintain their own private models and combine…
This paper proposes a distributed consensus algorithm for multi-agent systems with asymmetric actuator constraints and output safety constraints.
This paper studies the wait-free solvability of approximate agreement among asynchronous processes with shared read-write registers.
The paper proves that the majority vote of three independent consistent classifiers is an optimal learner in the realizable PAC setting.
Gatling is a new atomic broadcast protocol that achieves arbitrarily small inter-proposal times, even smaller than the network delay, by running multiple parallel instances of a black-box atomic broad…
This paper introduces Epistemic Byzantine Fault Tolerance (EBFT), a fault-tolerance model for agentic infrastructure and post-deterministic distributed systems, addressing the Honest Quorum Problem an…