Results 271 to 280 of about 6,215,927 (306)
Some of the next articles are maybe not open access.
Partial evaluation in Rank Aggregation Problems
Computers & Operations Research, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juan A. Aledo +2 more
openaire +3 more sources
A numerical tool for multiattribute ranking problems
Networks, 2003AbstractA large variety of techniques have been developed to solve or approximate the solution of multiattribute ranking problems. From such techniques, several implicit or explicit partial orders, defined on the same set of alternatives, are obtained (in many cases, by pairwise comparisons) with the goal of determining a linear order. Often, this goal
Domingos Moreira Cardoso +1 more
openaire +3 more sources
On the Ranks and Kernels Problem for Perfect Codes
Problems of Information Transmission, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergey V. Avgustinovich +2 more
openaire +1 more source
On Maximum Rank Aggregation Problems
2013The rank aggregation problem consists in finding a consensus ranking on a set of alternatives, based on the preferences of individual voters. These are expressed by permutations, whose distance can be measured in many ways.
Christian Bachmaier +3 more
openaire +2 more sources
Rank tests for changepoint problems
Biometrika, 1987We consider procedures based on quadratic form rank statistics to test for one or more change points in a series of independent observations. Models incorporating both smooth and abrupt changes are introduced. Various test statistics are suggested, their asymptotic null distributions are derived and tables of significance points are given.
openaire +1 more source
A combinatorial ranking problem
Aequationes Mathematicae, 1976An algorithm is presented for finding annth-best spanning tree of an edge-weighted graphG. In sharp contrast to related ranking algorithms, the number of steps is a linear function of the parametern. The results apply as well to ranking the bases of an abstract matroid.
Burns, R. N., Haff, C. E.
openaire +2 more sources
Solvability of the asynchronous ranking problem
Information Processing Letters, 1988The author shows that the ranking problem for a ring of n finite state machines is solvable if and only if n is prime.
openaire +3 more sources
On a Ranking Problem Associated with Basel II
Journal of Information & Knowledge Management, 2005Perceptron learning is discussed in the context of so-called scoring systems used for assessing creditworthiness as stipulated in the Basel II central banks capital accord of the G10-states. The solution of a related ranking problem using a generalised version of the pocket algorithm is described. A correctness proof of the algorithm is given.
openaire +3 more sources
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
2008We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximation algorithms for these problems. Together with Hegde and Jain, we recently proposed deterministic versions of some of these randomized algorithms [2].
Anke van Zuylen, David P. Williamson
openaire +1 more source