This paper uses integrated Data Envelopment Analysis (DEA) models to rank all extreme and non-extreme efficient Decision Making Units (DMUs) and then applies integrated DEA ranking method as a criterion to modify Genetic Algorithm (GA) for finding Pareto optimal solutions of a Multi Objective Programming (MOP) problem. The researchers have used ranking method as a shortcut way to modify GA to d...

One major problem in multilingual Question Answering (QA) is the combination of answers obtained from different languages into one single ranked list. This paper proposes a new method for tackling this problem. This method is founded on a graph-based ranking approach inspired in the popular Google’s PageRank algorithm. Experimental results demonstrate that the proposed method outperforms other ...

Instead of using citations or marketing academics’ perceptual ranking of journals, this article examines the ranking of marketing journals using Australian university library holdings, in either hard copy or full-text electronic format. This measure was used as a proxy for broad-based accessibility of marketing journals. The study found that the accessibility rankings differed significantly fro...

We use the directed networks between articles of 24 Wikipedia language editions for producing the Wikipedia Ranking of World Universities (WRWU) using PageRank, 2DRank and CheiRank algorithms. This approach allows to incorporate various cultural views on world universities using the mathematical statistical analysis independent of cultural preferences. The Wikipedia ranking of top 100 universit...

After the personal publication impact factor and clinical quality assessment tools, university ranking would appear to be developing as yet another intrusive instrument in our academic and professional life. For decades now, based on an increasing worldwide desire for comparative information, ranking has progressively become a well-accepted practice in many fields of human activity: sports, per...

Universities and higher education institutions form an integral part of the national infrastructure and prestige. As academic research benefits increasingly from international exchange and cooperation, many universities have increased investment in improving and enabling their global connectivity. Yet, the relationship of university performance and its global physical connectedness has not been...

Ranking of alternatives is a common, difficult and repeatedly addressed problem, especially when it requires negotiation of experts. The celebrated Arrow’s impossibility theorem expresses formally its difficulty. In spite of theprogressmadebyadopting soft ranking, the problem is far from being generically solved. The paper provides a, probably novel, problem formulation by viewing ranking of al...

In this paper we consider the edge ranking problem of weighted trees. We prove that a special instance of this problem, namely edge ranking of multitrees is NP-hard already for multitrees with diameter at most 10. Note that the same problem but for trees is linearly solvable. We give an O(log n)-approximation polynomial time algorithm for edge ranking of weighted trees.

This paper considers the problem of learning the ranking of' a set of' stochastic alternatives based upon incomplete information (i.e., a limited number of samples). We describe a system that, at each decision cycle, outputs either a complete ordering on the hypotheses or decides to gather additional information (Le., observations) at some cost. The ranking problem is a generalization of the pr...