𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convergence of inconsistency algorithms for the pairwise comparisons

✍ Scribed by Włodzimierz Holsztyński; Waldemar W. Koczkodaj

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
569 KB
Volume
59
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Adaptive Algorithm for Pairwise Compa
An Adaptive Algorithm for Pairwise Comparison-based Preference Measurement
✍ Martin Meißner; Reinhold Decker; Sören W. Scholz 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 278 KB

## ABSTRACT The Pairwise Comparison‐based Preference Measurement (PCPM) approach has been proposed for products featuring a large number of attributes. In the PCPM framework, a static two‐cyclic design is used to reduce the number of pairwise comparisons. However, adaptive questioning routines that

Techniques for bounding the convergence
Techniques for bounding the convergence rate of genetic algorithms
✍ Yuri Rabinovich; Avi Wigderson 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB 👁 2 views

The main purpose of the present paper is the study of computational aspects, ## Ž . and primarily the convergence rate, of genetic algorithms GAs . Despite the fact that such algorithms are widely used in practice, little is known so far about their theoretical properties, and in particular about