Networked systems are often subject to environmental uncertainties and communication delays, which make timely and accurate information exchange among neighbours difficult or impossible. This study investigates the distributed consensus problem of dynamical networks of multi-agents in which each agent can only obtain noisy and delayed measurements of the states of its neighbours. The authors co...

While the very first consensus protocols for the synchronous model were designed to match the worst-case lower bound, deciding in exactly t + 1 rounds in all runs, it was soon realized that they could be strictly improved upon by early stopping protocols. These dominate the first ones, by always deciding in at most t + 1 rounds, but often much faster. A protocol is unbeatable if it can’t be str...

This paper is concerned with the probability of consensus in a multivariate, spatially explicit version Hegselmann-Krause model for dynamics opinions. Individuals are located on vertices finite connected graph representing social network, and characterized by their opinion, set opinions $\Delta$ being general bounded convex subset dimensional normed vector space. Having confidence threshold $\t...

The paper was conducted to understand the factors affecting student’s learning location. official study carried out an online survey through Google forms using a questionnaire with participation of 125 samples. Bayesian Model Selection shows that 03 are student studying location (SSL), which Students’ perception (PP), Price (PRI), Perception universities in big city (UNI). From results, we have...

In this paper, an assembly of disordered packings is considered as a suitable set packing cells ordered spheres. consequence, any its parameters can be obtained by averaging the values set. Namely, density spheres described two variables: angle base, and inclined edge associated parallelepiped. Then, subsequent other angle, according to kind strain induced experiment. The average yields limits ...

We consider the fundamental problem of reaching consensus in multiagent systems. To date, the consensus problem has been typically solved with decentralized algorithms based on graph Laplacians. However, the convergence of these algorithms is often too slow for many important multiagent applications, and thus they are increasingly being combined with acceleration methods. Unfortunately, state-o...