Results 21 to 30 of about 12,421,662 (339)
Minkowski metrics in creating universal ranking algorithms [PDF]
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
Momentum Ranking Function of Z-Numbers and its Application to Game Theory
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
Size-Change Termination, Monotonicity Constraints and Ranking Functions [PDF]
Size-Change Termination (SCT) is a method of proving program termination based on the impossibility of infinite descent. To this end we may use a program abstraction in which transitions are described by monotonicity constraints over (abstract) variables.
Amir M. Ben-Amram
doaj +1 more source
التصنیف العنکبوتى للأرشیفات : دراسة تقییمیة للأرشیفات الوطنیة العربیة على الانترنت فى ضوء اسلوب القیاسات العنکبوتیة [PDF]
Recently, the international and national agencies have paid attention oninstitution ranking, top of which are universities and academic institutes. Theinstitution ranking helps unveil the institute ranking and quality.
د. عبد الرحمن فراج
doaj +1 more source
Policy-Gradient Training of Fair and Unbiased Ranking Functions [PDF]
While implicit feedback (e.g., clicks, dwell times, etc.) is an abundant and attractive source of data for learning to rank, it can produce unfair ranking policies for both exogenous and endogenous reasons. Exogenous reasons typically manifest themselves
Himank Yadav, Zhengxiao Du, T. Joachims
semanticscholar +1 more source
Data envelopment analysis based on triangular neutrosophic numbers
Data envelopment analysis (DEA) is one of the best mathematical techniques to compute the overall performance of units with some inputs and outputs. The original DEA methods are developed to tackle the information based on the crisp number but no ability
S.A. Edalatpanah
doaj +1 more source
Ranking Templates for Linear Loops [PDF]
We present a new method for the constraint-based synthesis of termination arguments for linear loop programs based on linear ranking templates. Linear ranking templates are parameterized, well-founded relations such that an assignment to the parameters ...
Jan Leike, Matthias Heizmann
doaj +1 more source
Termination Analysis of Single Path Loop Programs Based on Iterative Trajectory Division [PDF]
The ranking function has been extensively studied as an important method of program termination analysis.In this paper,we focus on the termination of single-path loops.Firstly,the concept of two-way iterative loops is proposed,and the single-path loops ...
WANG Yao, LI Yi
doaj +1 more source
Docking using different programs provides more reliable information about the interaction of molecules than data obtained in a single program. An exponential consensus ranking (ECR) was developed to combine scoring functions across docking programs ...
Fabiani Triches +2 more
doaj +1 more source
Multiphase-Linear Ranking Functions and their Relation to Recurrent Sets [PDF]
Multiphase ranking functions (M$\Phi$RFs) are tuples $\langle f_1,\ldots,f_d \rangle$ of linear functions that are often used to prove termination of loops in which the computation progresses through a number of "phases".
Amir M. Ben-Amram +2 more
semanticscholar +1 more source

