Thông tin tài liệu
Thông tin siêu dữ liệu biểu ghi
| Trường DC | Giá trị | Ngôn ngữ |
|---|---|---|
| dc.contributor.author | Noelia, Rico | - |
| dc.contributor.author | Pedro, Alonso | - |
| dc.contributor.author | Irene, Díaz | - |
| dc.date.accessioned | 2023-04-25T01:54:01Z | - |
| dc.date.available | 2023-04-25T01:54:01Z | - |
| dc.date.issued | 2023 | - |
| dc.identifier.uri | https://link.springer.com/article/10.1007/s11227-023-05058-w | - |
| dc.identifier.uri | https://dlib.phenikaa-uni.edu.vn/handle/PNK/8252 | - |
| dc.description | CC BY | vi |
| dc.description.abstract | Ranking aggregation, studied in the field of social choice theory, focuses on the combination of information with the aim of determining a winning ranking among some alternatives when the preferences of the voters are expressed by ordering the possible alternatives from most to least preferred. One of the most famous ranking aggregation methods can be traced back to 1959, when Kemeny introduces a measure of distance between a ranking and the opinion of the voters gathered in a profile of rankings. Using this, he proposed to elect as winning ranking of the election the one that minimizes the distance to the profile. This is factorial on the number of alternatives, posing a handicap in the runtime of the algorithms developed to find the winning ranking, which prevents its use in real problems where the number of alternatives is large. In this work we introduce the first algorithm for the Kemeny problem designed to be executed in a Graphical Processing Unit. | vi |
| dc.language.iso | en | vi |
| dc.publisher | Springer | vi |
| dc.subject | Graphical Processing Unit. | vi |
| dc.subject | Graphical Processing Unit. | vi |
| dc.title | Kemeny ranking aggregation meets the GPU | vi |
| dc.type | Book | vi |
| Bộ sưu tập | ||
| OER - Công nghệ thông tin | ||
Danh sách tệp tin đính kèm:
