Please use this identifier to cite or link to this item: https://elib.vku.udn.vn/handle/123456789/2154
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDang, Dai Tho-
dc.contributor.authorNguyen, Thanh Ngo-
dc.contributor.authorHwang, Dosam-
dc.date.accessioned2022-06-21T07:37:07Z-
dc.date.available2022-06-21T07:37:07Z-
dc.date.issued2022-01-
dc.identifier.citationhttps://doi.org/10.2298/CSIS210314062Dvi_VN
dc.identifier.issn1820-0214-
dc.identifier.urihttp://elib.vku.udn.vn/handle/123456789/2154-
dc.descriptionComputer Science and Information Systems 2022 Volume 19, Issue 1, Pages: 435-453vi_VN
dc.description.abstractNowadays, using the consensus of collectives for solving problems plays an essential role in our lives. The rapid development of information technology has facilitated the collection of distributed knowledge from autonomous sources to find solutions to problems. Consequently, the size of collectives has increased rapidly. Determining consensus for a large collective is very time-consuming and expensive. Thus, this study proposes a vertical partition method (VPM) to find consensus in large collectives. In the VPM, the primary collective is first vertically partitioned into small parts. Then, a consensus-based algorithm is used to determine the consensus for each smaller part. Finally, the consensus of the collective is determined based on the consensuses of the smaller parts. The study demonstrates, both theoretically and experimentally, that the computational complexity of the VPM is lower than 57.1% that of the basic consensus method (BCM). This ratio reduces quickly if the number of smaller parts reduces.vi_VN
dc.language.isoenvi_VN
dc.publisherComSIS Consortiumvi_VN
dc.subjectlarge collectivevi_VN
dc.subjectconsensusvi_VN
dc.subjectalgorithmvi_VN
dc.subjectcomputational complexityvi_VN
dc.titleAn Effective Method for Determining Consensus in Large Collectivesvi_VN
dc.typeWorking Papervi_VN
Appears in Collections:NĂM 2022

Files in This Item:

 Sign in to read



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.