Results 1 to 10 of about 12,507,393 (302)

On Theoretically Optimal Ranking Functions in Bipartite Ranking [PDF]

Journal of the American Statistical Association, 2017
This article investigates the theoretical relation between loss criteria and the optimal ranking functions driven by the criteria in bipartite ranking.
Kazuki Uematsu, Yoonkyung Lee
exaly   +3 more sources

On the ERA ranking representability of pairwise bipartite ranking functions

Artificial Intelligence, 2011
In domains like decision theory and social choice theory it is known for a long time that stochastic transitivity properties yield necessary and sufficient conditions for the ranking or utility representability of reciprocal preference relations. In this
Bernard De Baets, Willem Waegeman
exaly   +4 more sources

Eventual linear ranking functions [PDF]

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, 2013
Program termination is a hot research topic in program analysis. The last few years have witnessed the development of termination analyzers for programming languages such as C and Java with remarkable precision and performance.
Roberto Bagnara, F. Mesnard
semanticscholar   +5 more sources

Ranking functions and rankings on languages

Artificial Intelligence, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Franz Huber
exaly   +4 more sources

Synthesis of ranking functions using extremal counterexamples

ACM SIGPLAN Notices, 2015
We present a complete method for synthesizing lexicographic linear ranking functions (and thus proving termination), supported by inductive invariants, in the case where the transition relation of the program includes disjunctions and existentials (large
David Monniaux, Laure Gonnord
exaly   +2 more sources

On Multiphase-Linear Ranking Functions [PDF]

International Conference on Computer Aided Verification, 2017
Multiphase ranking functions (\( M\varPhi \)RFs) were proposed as a means to prove the termination of a loop in which the computation progresses through a number of “phases”, and the progress of each phase is described by a different linear ranking ...
Amir M. Ben-Amram, S. Genaim
semanticscholar   +3 more sources

Supermartingales, Ranking Functions and Probabilistic Lambda Calculus [PDF]

Logic in Computer Science, 2021
We introduce a method for proving almost sure termination in the context of lambda calculus with continuous random sampling and explicit recursion, based on ranking supermartingales. This result is extended in three ways.
Andrew Kenyon-Roberts, C. Ong
semanticscholar   +1 more source

Minkowski metrics in creating universal ranking algorithms [PDF]

Biuletyn Wojskowej Akademii Technicznej, 2014
The paper presents a general procedure for creating the rankings of a set of objects, while the relation of preference based on any ranking function. The analysis was possible to use the ranking functions began by showing the fundamental drawbacks of ...
Andrzej Ameljańczyk
doaj   +1 more source

Ranking Functions for Size-Change Termination II [PDF]

Logical Methods in Computer Science, 2009
Size-Change Termination is an increasingly-popular technique for verifying program termination. These termination proofs are deduced from an abstract representation of the program in the form of "size-change graphs".
Amir M. Ben-Amram, Chin Soon Lee
doaj   +1 more source

Momentum Ranking Function of Z-Numbers and its Application to Game Theory

مجلة بغداد للعلوم, 2023
After Zadeh introduced the concept of z-number scientists in various fields have shown keen interest in applying this concept in various applications. In applications of z-numbers, to compare two z-numbers, a ranking procedure is essential.  While a few
K. PARAMESWARI, G. VELAMMAL
doaj   +1 more source