Szczegóły publikacji
Opis bibliograficzny
A concurrent inconsistency reduction algorithm for the pairwise comparisons method / Konrad KUŁAKOWSKI, Radosław Juszczyk, Sebastian ERNST // W: Artificial Intelligence and Soft Computing : 14th International Conference, ICAISC 2015 : Zakopane, Poland, June 14–18, 2015 : proceedings, Pt. 2 / eds. Leszek Rutkowski, [et al.]. — Cham, [etc.] : Springer, cop. 2015. — (Lecture Notes in Computer Science ; ISSN 0302-9743. Lecture Notes in Artificial Intelligence ; LNAI 9120). — ISBN: 978-3-319-19368-7; e-ISBN: 978-3-319-19369-4. — S. 214–222. — Bibliogr. s. 222, Abstr.
Autorzy (3)
- AGHKułakowski Konrad
- Juszczyk Radosław
- AGHErnst Sebastian
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 90210 |
|---|---|
| Data dodania do BaDAP | 2015-07-02 |
| DOI | 10.1007/978-3-319-19369-4_20 |
| Rok publikacji | 2015 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencja | International Conference on Artificial Intelligence and Soft Computing 2015 |
| Czasopismo/seria | Lecture Notes in Computer Science |
Abstract
This paper presents a concurrent algorithm for computing a consistent approximation to a generalized pairwise comparisons matrix (i.e. it is assumed that the reciprocity property is not required). Like its sequential counterpart, it is based on the iterative strategy "find the worst case and fix it". The conducted experiments confirmed that a significant increase in speed between the sequential and concurrent approach is achieved. Our results may be particularly important for the large decision support systems where the number of pairs considered is large and the sequential approach may not be fast enough.
