We consider continuous-time consensus seeking systems whose time-dependent interactions are cut-balanced, in the following sense: if a group of agents influences the remaining on...
In this paper a distributed algorithm for clock synchronization is proposed. This algorithm is based on an extension of the consensus algorithm able to synchronize a family of dou...
We introduce the use of negative preferences to produce solutions that are acceptable to a group of users. Using negative preference profiling, a system determines which solution...
Dennis L. Chao, Justin Balthrop, Stephanie Forrest
Background: Computer programs for the generation of multiple sequence alignments such as "Clustal W" allow detection of regions that are most conserved among many sequen...
Olga V. Matveeva, Brian T. Foley, Vladimir A. Nemt...
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...