Results 281 to 290 of about 282,377 (316)

On Maximum Rank Aggregation Problems

2013
The 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, Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier   +3 more
openaire   +1 more source

A numerical tool for multiattribute ranking problems

Networks, 2003
AbstractA 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, Jorge Freire de Sousa   +1 more
openaire   +3 more sources

Partial evaluation in Rank Aggregation Problems

Computers & Operations Research, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juan A. Aledo, José A. Gámez 0001, Alejandro Rosete   +2 more
openaire   +2 more sources

Rank tests for changepoint problems

Biometrika, 1987
We 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, 1976
An 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, 1988
The author shows that the ranking problem for a ring of n finite state machines is solvable if and only if n is prime.
openaire   +2 more sources

On a Ranking Problem Associated with Basel II

Journal of Information & Knowledge Management, 2005
Perceptron 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   +2 more sources

Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems

2008
We 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

The Problem of Birth Ranks

Biometrics, 1952
A CHARACTERISTIC C is observed in the r-th member (in order of birth) of a family of children of size s. The question arises whether C tends to be associated with earlier (or later) births rather than to be randomly distributed over all values of r from 1 to s. The problem was brought to my attention by Dr.
openaire   +1 more source

By the Numbers: Ranking the Problem

2019
A general equation is introduced to allow comparison of environmental problems. The equation takes into account current and future potential for human deaths as well as current and future suffering. It deliberates over the unknowns in predicting the number of deaths and amount of suffering for major causes and how to compare death to suffering for each
openaire   +1 more source