✦ LIBER ✦

A Branch and Bound Algorithm for Maximum Likelihood Paired Comparison Ranking

✍ Scribed by John S. deCani

Book ID: 124288883
Publisher: Oxford University Press
Year: 1972
Tongue: English
Weight: 435 KB
Volume: 59
Category: Article
ISSN: 0006-3444
DOI: 10.2307/2334623

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Branch Search Algorithm for Maximum Li

A Branch Search Algorithm for Maximum Likelihood Paired Comparison Ranking

✍ John A. Flueck and James F. Korsh 📂 Article 📅 1974 🏛 Oxford University Press 🌐 English ⚖ 547 KB

Maximum likelihood paired-comparison ran

Maximum likelihood paired-comparison ranking and quadratic assignment

✍ HUBERT, LAWRENCE; SCHULTZ, JAMES 📂 Article 📅 1975 🏛 Oxford University Press 🌐 English ⚖ 258 KB

Maximum Likelihood Paired-Comparison Ran

Maximum Likelihood Paired-Comparison Ranking and Quadratic Assignment

✍ Lawrence Hubert and James Schultz 📂 Article 📅 1975 🏛 Oxford University Press 🌐 English ⚖ 498 KB

A computer program for maximum likelihoo

A computer program for maximum likelihood paired comparison rankings

✍ Thomas G. Loflin; C.Alex McMahan 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 437 KB

We describe a program for obtaining esttmates of the rank order of objects in a paired comparison experiment. The prolvam uses Rcmage and Thompson's dynamic programming algorithm [3] to obtain that rank,ng which maximize.~ the likelihood function with the restriction of weak stochastic transitivity.

Maximum-Likelihood Paired Comparison Ran

Maximum-Likelihood Paired Comparison Rankings

✍ Russell Remage, Jr. and W. A. Thompson, Jr. 📂 Article 📅 1966 🏛 Oxford University Press 🌐 English ⚖ 671 KB

Maximum-likelihood detection based on br

Maximum-likelihood detection based on branch and bound algorithm for MIMO systems

✍ Zi Li; YueMing Cai 📂 Article 📅 2008 🏛 Science in China Press (SCP) 🌐 English ⚖ 676 KB